./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.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 cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:40:19,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:40:19,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:40:19,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:40:19,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:40:19,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:40:19,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:40:19,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:40:19,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:40:19,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:40:19,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:40:19,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:40:19,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:40:19,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:40:19,990 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:40:19,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:40:19,990 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:40:19,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:40:19,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:40:19,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:40:19,995 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:40:19,995 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:40:19,995 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:40:19,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:40:19,996 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:40:19,996 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:40:19,996 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:40:19,996 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:40:19,997 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:40:19,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:40:19,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:40:19,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:40:19,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:40:19,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:40:19,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:40:19,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:40:19,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:40:19,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:40:19,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:40:19,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:40:19,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:40:20,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:40:20,001 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 -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2024-11-20 14:40:20,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:40:20,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:40:20,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:40:20,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:40:20,258 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:40:20,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2024-11-20 14:40:21,682 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:40:21,927 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:40:21,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2024-11-20 14:40:21,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df83504b6/1fa4394ac0b64c689d14364e97ab8690/FLAG4daef1274 [2024-11-20 14:40:21,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df83504b6/1fa4394ac0b64c689d14364e97ab8690 [2024-11-20 14:40:21,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:40:21,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:40:21,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:40:21,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:40:21,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:40:21,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:40:21" (1/1) ... [2024-11-20 14:40:21,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136e88ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:21, skipping insertion in model container [2024-11-20 14:40:21,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:40:21" (1/1) ... [2024-11-20 14:40:22,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:40:22,358 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:40:22,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:40:22,431 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:40:22,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:40:22,514 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:40:22,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22 WrapperNode [2024-11-20 14:40:22,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:40:22,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:40:22,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:40:22,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:40:22,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (1/1) ... [2024-11-20 14:40:22,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (1/1) ... [2024-11-20 14:40:22,557 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2024-11-20 14:40:22,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:40:22,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:40:22,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:40:22,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:40:22,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (1/1) ... [2024-11-20 14:40:22,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (1/1) ... [2024-11-20 14:40:22,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (1/1) ... [2024-11-20 14:40:22,607 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-20 14:40:22,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (1/1) ... [2024-11-20 14:40:22,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (1/1) ... [2024-11-20 14:40:22,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (1/1) ... [2024-11-20 14:40:22,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (1/1) ... [2024-11-20 14:40:22,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (1/1) ... [2024-11-20 14:40:22,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (1/1) ... [2024-11-20 14:40:22,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:40:22,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:40:22,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:40:22,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:40:22,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (1/1) ... [2024-11-20 14:40:22,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:40:22,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:22,680 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-20 14:40:22,683 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-20 14:40:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 14:40:22,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 14:40:22,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 14:40:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 14:40:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 14:40:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 14:40:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:40:22,732 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-20 14:40:22,732 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-20 14:40:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:40:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 14:40:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:40:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:40:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 14:40:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:40:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:40:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 14:40:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:40:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-20 14:40:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-20 14:40:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-20 14:40:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 14:40:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 14:40:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 14:40:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:40:22,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:40:22,879 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:40:22,884 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:40:23,391 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-20 14:40:23,391 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:40:23,422 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:40:23,427 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-20 14:40:23,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:40:23 BoogieIcfgContainer [2024-11-20 14:40:23,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:40:23,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:40:23,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:40:23,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:40:23,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:40:21" (1/3) ... [2024-11-20 14:40:23,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e3a639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:40:23, skipping insertion in model container [2024-11-20 14:40:23,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:22" (2/3) ... [2024-11-20 14:40:23,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e3a639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:40:23, skipping insertion in model container [2024-11-20 14:40:23,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:40:23" (3/3) ... [2024-11-20 14:40:23,437 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2024-11-20 14:40:23,454 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:40:23,454 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-11-20 14:40:23,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:40:23,507 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;@53fe0db7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:40:23,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-20 14:40:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 99 states have (on average 2.101010101010101) internal successors, (208), 191 states have internal predecessors, (208), 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-20 14:40:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 14:40:23,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:23,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 14:40:23,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:23,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash 5145481, now seen corresponding path program 1 times [2024-11-20 14:40:23,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:23,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945069950] [2024-11-20 14:40:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:23,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:23,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:23,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945069950] [2024-11-20 14:40:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945069950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:23,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:40:23,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759678997] [2024-11-20 14:40:23,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:23,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 14:40:23,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:23,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 14:40:23,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 14:40:23,711 INFO L87 Difference]: Start difference. First operand has 195 states, 99 states have (on average 2.101010101010101) internal successors, (208), 191 states have internal predecessors, (208), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:23,740 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2024-11-20 14:40:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 14:40:23,742 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-20 14:40:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:23,749 INFO L225 Difference]: With dead ends: 195 [2024-11-20 14:40:23,749 INFO L226 Difference]: Without dead ends: 193 [2024-11-20 14:40:23,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 14:40:23,756 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:23,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:40:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-20 14:40:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-20 14:40:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 98 states have (on average 2.0510204081632653) internal successors, (201), 189 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 14:40:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2024-11-20 14:40:23,800 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 4 [2024-11-20 14:40:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:23,801 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2024-11-20 14:40:23,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2024-11-20 14:40:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 14:40:23,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:23,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 14:40:23,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:40:23,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:23,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:23,803 INFO L85 PathProgramCache]: Analyzing trace with hash 5143045, now seen corresponding path program 1 times [2024-11-20 14:40:23,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:23,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587358472] [2024-11-20 14:40:23,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:23,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:24,032 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-20 14:40:24,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:24,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587358472] [2024-11-20 14:40:24,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587358472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:24,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:24,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:40:24,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601047940] [2024-11-20 14:40:24,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:24,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:40:24,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:24,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:40:24,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:40:24,037 INFO L87 Difference]: Start difference. First operand 193 states and 205 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:24,290 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2024-11-20 14:40:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:40:24,292 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-20 14:40:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:24,293 INFO L225 Difference]: With dead ends: 187 [2024-11-20 14:40:24,294 INFO L226 Difference]: Without dead ends: 187 [2024-11-20 14:40:24,294 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-20 14:40:24,295 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 77 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:24,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-20 14:40:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-20 14:40:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 98 states have (on average 1.989795918367347) internal successors, (195), 183 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 14:40:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2024-11-20 14:40:24,307 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 4 [2024-11-20 14:40:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:24,307 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2024-11-20 14:40:24,307 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-20 14:40:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2024-11-20 14:40:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 14:40:24,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:24,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 14:40:24,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:40:24,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:24,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash 5143046, now seen corresponding path program 1 times [2024-11-20 14:40:24,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:24,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028832048] [2024-11-20 14:40:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:24,449 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-20 14:40:24,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:24,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028832048] [2024-11-20 14:40:24,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028832048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:24,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:24,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:40:24,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405747196] [2024-11-20 14:40:24,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:24,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:40:24,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:24,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:40:24,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:40:24,453 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:24,735 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2024-11-20 14:40:24,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:40:24,739 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-20 14:40:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:24,741 INFO L225 Difference]: With dead ends: 203 [2024-11-20 14:40:24,741 INFO L226 Difference]: Without dead ends: 203 [2024-11-20 14:40:24,741 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-20 14:40:24,744 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:24,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 361 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:40:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-20 14:40:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2024-11-20 14:40:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 103 states have (on average 1.9611650485436893) internal successors, (202), 188 states have internal predecessors, (202), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 14:40:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2024-11-20 14:40:24,769 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 4 [2024-11-20 14:40:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:24,769 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2024-11-20 14:40:24,770 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-20 14:40:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2024-11-20 14:40:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 14:40:24,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:24,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 14:40:24,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:40:24,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:24,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:24,771 INFO L85 PathProgramCache]: Analyzing trace with hash 159434512, now seen corresponding path program 1 times [2024-11-20 14:40:24,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:24,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077937880] [2024-11-20 14:40:24,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:24,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:24,834 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-20 14:40:24,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:24,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077937880] [2024-11-20 14:40:24,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077937880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:24,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:24,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:40:24,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556002426] [2024-11-20 14:40:24,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:24,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:40:24,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:24,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:40:24,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:40:24,838 INFO L87 Difference]: Start difference. First operand 192 states and 206 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:24,977 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2024-11-20 14:40:24,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:40:24,978 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-20 14:40:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:24,979 INFO L225 Difference]: With dead ends: 190 [2024-11-20 14:40:24,980 INFO L226 Difference]: Without dead ends: 190 [2024-11-20 14:40:24,980 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-20 14:40:24,981 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 15 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:24,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 279 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-20 14:40:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-20 14:40:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 103 states have (on average 1.9320388349514563) internal successors, (199), 186 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 14:40:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2024-11-20 14:40:24,995 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 5 [2024-11-20 14:40:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:24,995 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2024-11-20 14:40:24,995 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-20 14:40:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2024-11-20 14:40:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 14:40:24,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:24,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 14:40:24,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:40:24,996 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:24,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash 159434513, now seen corresponding path program 1 times [2024-11-20 14:40:24,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:24,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575459764] [2024-11-20 14:40:24,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:25,074 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-20 14:40:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575459764] [2024-11-20 14:40:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575459764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:25,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:25,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:40:25,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077942424] [2024-11-20 14:40:25,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:25,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:40:25,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:25,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:40:25,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:40:25,077 INFO L87 Difference]: Start difference. First operand 190 states and 203 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:25,192 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2024-11-20 14:40:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:40:25,192 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-20 14:40:25,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:25,193 INFO L225 Difference]: With dead ends: 188 [2024-11-20 14:40:25,193 INFO L226 Difference]: Without dead ends: 188 [2024-11-20 14:40:25,194 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-20 14:40:25,195 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:25,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 286 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-20 14:40:25,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-20 14:40:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 103 states have (on average 1.9029126213592233) internal successors, (196), 184 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 14:40:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2024-11-20 14:40:25,201 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 5 [2024-11-20 14:40:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:25,201 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2024-11-20 14:40:25,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-20 14:40:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2024-11-20 14:40:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 14:40:25,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:25,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:25,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:40:25,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:25,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:25,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1660605353, now seen corresponding path program 1 times [2024-11-20 14:40:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311454582] [2024-11-20 14:40:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:25,353 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-20 14:40:25,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:25,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311454582] [2024-11-20 14:40:25,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311454582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:25,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:25,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:40:25,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588302788] [2024-11-20 14:40:25,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:25,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:40:25,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:25,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:40:25,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:40:25,355 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:25,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:25,442 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2024-11-20 14:40:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:40:25,443 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-20 14:40:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:25,444 INFO L225 Difference]: With dead ends: 197 [2024-11-20 14:40:25,444 INFO L226 Difference]: Without dead ends: 197 [2024-11-20 14:40:25,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:25,445 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 18 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:25,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 722 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-20 14:40:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2024-11-20 14:40:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.8942307692307692) internal successors, (197), 185 states have internal predecessors, (197), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 14:40:25,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2024-11-20 14:40:25,451 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 10 [2024-11-20 14:40:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:25,451 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2024-11-20 14:40:25,451 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-20 14:40:25,451 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2024-11-20 14:40:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 14:40:25,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:25,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:25,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:40:25,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:25,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1883038802, now seen corresponding path program 1 times [2024-11-20 14:40:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:25,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734080892] [2024-11-20 14:40:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:25,520 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-20 14:40:25,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:25,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734080892] [2024-11-20 14:40:25,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734080892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:25,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:25,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:40:25,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171868273] [2024-11-20 14:40:25,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:25,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:40:25,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:25,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:40:25,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:40:25,522 INFO L87 Difference]: Start difference. First operand 189 states and 201 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:25,565 INFO L93 Difference]: Finished difference Result 269 states and 285 transitions. [2024-11-20 14:40:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:40:25,566 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-20 14:40:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:25,568 INFO L225 Difference]: With dead ends: 269 [2024-11-20 14:40:25,568 INFO L226 Difference]: Without dead ends: 269 [2024-11-20 14:40:25,568 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-20 14:40:25,569 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 84 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:25,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 569 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:40:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-20 14:40:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2024-11-20 14:40:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 147 states have (on average 1.91156462585034) internal successors, (281), 228 states have internal predecessors, (281), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 14:40:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2024-11-20 14:40:25,579 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 12 [2024-11-20 14:40:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:25,580 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2024-11-20 14:40:25,581 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-20 14:40:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2024-11-20 14:40:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:40:25,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:25,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:25,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:40:25,582 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:25,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:25,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1755333093, now seen corresponding path program 1 times [2024-11-20 14:40:25,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:25,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679086588] [2024-11-20 14:40:25,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:25,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:25,651 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-20 14:40:25,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:25,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679086588] [2024-11-20 14:40:25,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679086588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:25,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:25,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:40:25,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211870544] [2024-11-20 14:40:25,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:25,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:40:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:25,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:40:25,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:40:25,653 INFO L87 Difference]: Start difference. First operand 233 states and 285 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:25,784 INFO L93 Difference]: Finished difference Result 233 states and 279 transitions. [2024-11-20 14:40:25,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:40:25,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 14:40:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:25,786 INFO L225 Difference]: With dead ends: 233 [2024-11-20 14:40:25,786 INFO L226 Difference]: Without dead ends: 233 [2024-11-20 14:40:25,787 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-20 14:40:25,787 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 43 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:25,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 220 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-20 14:40:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2024-11-20 14:40:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 155 states have (on average 1.761290322580645) internal successors, (273), 224 states have internal predecessors, (273), 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-20 14:40:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 277 transitions. [2024-11-20 14:40:25,796 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 277 transitions. Word has length 13 [2024-11-20 14:40:25,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:25,797 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 277 transitions. [2024-11-20 14:40:25,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:25,797 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 277 transitions. [2024-11-20 14:40:25,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:40:25,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:25,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:25,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:40:25,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:25,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1755333092, now seen corresponding path program 1 times [2024-11-20 14:40:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:25,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073020687] [2024-11-20 14:40:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:25,891 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-20 14:40:25,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:25,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073020687] [2024-11-20 14:40:25,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073020687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:25,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:25,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:40:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902426343] [2024-11-20 14:40:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:25,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:40:25,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:40:25,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:40:25,894 INFO L87 Difference]: Start difference. First operand 229 states and 277 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:26,020 INFO L93 Difference]: Finished difference Result 236 states and 273 transitions. [2024-11-20 14:40:26,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:40:26,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 14:40:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:26,022 INFO L225 Difference]: With dead ends: 236 [2024-11-20 14:40:26,022 INFO L226 Difference]: Without dead ends: 236 [2024-11-20 14:40:26,023 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-20 14:40:26,023 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 43 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:26,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 228 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-20 14:40:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 230. [2024-11-20 14:40:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 165 states have (on average 1.6181818181818182) internal successors, (267), 225 states have internal predecessors, (267), 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-20 14:40:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 271 transitions. [2024-11-20 14:40:26,031 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 271 transitions. Word has length 13 [2024-11-20 14:40:26,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:26,031 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 271 transitions. [2024-11-20 14:40:26,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 271 transitions. [2024-11-20 14:40:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 14:40:26,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:26,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:26,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:40:26,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:26,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:26,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1838603521, now seen corresponding path program 1 times [2024-11-20 14:40:26,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:26,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098139365] [2024-11-20 14:40:26,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:26,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:26,163 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-20 14:40:26,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:26,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098139365] [2024-11-20 14:40:26,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098139365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:26,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:26,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:40:26,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130152168] [2024-11-20 14:40:26,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:26,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:40:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:26,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:40:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:40:26,168 INFO L87 Difference]: Start difference. First operand 230 states and 271 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:26,370 INFO L93 Difference]: Finished difference Result 283 states and 337 transitions. [2024-11-20 14:40:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:40:26,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 14:40:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:26,373 INFO L225 Difference]: With dead ends: 283 [2024-11-20 14:40:26,373 INFO L226 Difference]: Without dead ends: 283 [2024-11-20 14:40:26,374 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-20 14:40:26,374 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 24 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:26,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 443 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-20 14:40:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 238. [2024-11-20 14:40:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 233 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 14:40:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 283 transitions. [2024-11-20 14:40:26,383 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 283 transitions. Word has length 18 [2024-11-20 14:40:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:26,383 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 283 transitions. [2024-11-20 14:40:26,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 283 transitions. [2024-11-20 14:40:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 14:40:26,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:26,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:26,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:40:26,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:26,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1838603520, now seen corresponding path program 1 times [2024-11-20 14:40:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:26,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594490535] [2024-11-20 14:40:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:26,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:26,605 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-20 14:40:26,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:26,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594490535] [2024-11-20 14:40:26,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594490535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:26,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:26,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:40:26,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319398303] [2024-11-20 14:40:26,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:26,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:40:26,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:26,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:40:26,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:40:26,607 INFO L87 Difference]: Start difference. First operand 238 states and 283 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:26,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:26,827 INFO L93 Difference]: Finished difference Result 238 states and 279 transitions. [2024-11-20 14:40:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:26,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 14:40:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:26,828 INFO L225 Difference]: With dead ends: 238 [2024-11-20 14:40:26,829 INFO L226 Difference]: Without dead ends: 238 [2024-11-20 14:40:26,829 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-20 14:40:26,829 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 4 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:26,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 452 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-20 14:40:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-20 14:40:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 173 states have (on average 1.5895953757225434) internal successors, (275), 233 states have internal predecessors, (275), 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-20 14:40:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 279 transitions. [2024-11-20 14:40:26,835 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 279 transitions. Word has length 18 [2024-11-20 14:40:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:26,836 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 279 transitions. [2024-11-20 14:40:26,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 279 transitions. [2024-11-20 14:40:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 14:40:26,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:26,836 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:26,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:40:26,837 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:26,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:26,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1290773501, now seen corresponding path program 1 times [2024-11-20 14:40:26,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:26,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827368990] [2024-11-20 14:40:26,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:26,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:27,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:27,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827368990] [2024-11-20 14:40:27,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827368990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:27,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857711196] [2024-11-20 14:40:27,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:27,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:27,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:27,056 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-20 14:40:27,058 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-20 14:40:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:27,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 14:40:27,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:40:27,232 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-20 14:40:27,274 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-20 14:40:27,335 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 14:40:27,336 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-20 14:40:27,371 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-20 14:40:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:27,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:40:27,407 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-20 14:40:27,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-20 14:40:27,417 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_162 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_162) c_create_data_~data~0.base) (+ c_create_data_~data~0.offset 4)) |c_create_data_#t~mem8.base|)) is different from false [2024-11-20 14:40:27,428 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_162 (Array Int Int))) (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))) (= (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_162) c_create_data_~data~0.base) .cse1) .cse0)))) is different from false [2024-11-20 14:40:27,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:27,443 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 22 treesize of output 23 [2024-11-20 14:40:27,446 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 36 treesize of output 24 [2024-11-20 14:40:27,449 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 7 treesize of output 3 [2024-11-20 14:40:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-20 14:40:27,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857711196] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:40:27,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:40:27,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-20 14:40:27,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818522903] [2024-11-20 14:40:27,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:40:27,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:40:27,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:27,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:40:27,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=70, Unknown=2, NotChecked=34, Total=132 [2024-11-20 14:40:27,456 INFO L87 Difference]: Start difference. First operand 238 states and 279 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 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-20 14:40:27,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:27,723 INFO L93 Difference]: Finished difference Result 241 states and 279 transitions. [2024-11-20 14:40:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:40:27,724 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 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 24 [2024-11-20 14:40:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:27,725 INFO L225 Difference]: With dead ends: 241 [2024-11-20 14:40:27,725 INFO L226 Difference]: Without dead ends: 241 [2024-11-20 14:40:27,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=82, Unknown=2, NotChecked=38, Total=156 [2024-11-20 14:40:27,726 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 69 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:27,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 951 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 321 Invalid, 0 Unknown, 123 Unchecked, 0.2s Time] [2024-11-20 14:40:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-20 14:40:27,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2024-11-20 14:40:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 173 states have (on average 1.5780346820809248) internal successors, (273), 232 states have internal predecessors, (273), 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-20 14:40:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 277 transitions. [2024-11-20 14:40:27,732 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 277 transitions. Word has length 24 [2024-11-20 14:40:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:27,732 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 277 transitions. [2024-11-20 14:40:27,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 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-20 14:40:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 277 transitions. [2024-11-20 14:40:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 14:40:27,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:27,733 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:27,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 14:40:27,933 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,SelfDestructingSolverStorable11 [2024-11-20 14:40:27,934 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:27,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:27,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1290773500, now seen corresponding path program 1 times [2024-11-20 14:40:27,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:27,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150273053] [2024-11-20 14:40:27,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:27,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:28,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:28,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150273053] [2024-11-20 14:40:28,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150273053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:28,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837940511] [2024-11-20 14:40:28,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:28,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:28,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:28,324 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-20 14:40:28,326 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-20 14:40:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:28,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 14:40:28,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:40:28,467 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-20 14:40:28,472 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-20 14:40:28,479 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-20 14:40:28,511 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-20 14:40:28,517 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-20 14:40:28,660 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 14:40:28,661 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-20 14:40:28,673 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-20 14:40:28,743 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-20 14:40:28,749 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-20 14:40:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:28,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:40:28,881 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_create_data_~counter~0 4)) (.cse0 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0) .cse1 4))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0)))))) is different from false [2024-11-20 14:40:28,907 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_222 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_221) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-11-20 14:40:28,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:28,979 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-20 14:40:28,983 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-20 14:40:28,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:28,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-20 14:40:29,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:29,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-20 14:40:29,006 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:29,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-20 14:40:29,011 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:29,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-20 14:40:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-20 14:40:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837940511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:40:29,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:40:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2024-11-20 14:40:29,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815024336] [2024-11-20 14:40:29,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:40:29,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-20 14:40:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:29,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 14:40:29,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=8, NotChecked=74, Total=462 [2024-11-20 14:40:29,046 INFO L87 Difference]: Start difference. First operand 237 states and 277 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:29,876 INFO L93 Difference]: Finished difference Result 249 states and 289 transitions. [2024-11-20 14:40:29,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:40:29,877 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-20 14:40:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:29,878 INFO L225 Difference]: With dead ends: 249 [2024-11-20 14:40:29,878 INFO L226 Difference]: Without dead ends: 249 [2024-11-20 14:40:29,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=8, NotChecked=86, Total=600 [2024-11-20 14:40:29,878 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 11 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:29,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1533 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1089 Invalid, 0 Unknown, 183 Unchecked, 0.7s Time] [2024-11-20 14:40:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-20 14:40:29,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2024-11-20 14:40:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 185 states have (on average 1.5405405405405406) internal successors, (285), 244 states have internal predecessors, (285), 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-20 14:40:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 289 transitions. [2024-11-20 14:40:29,884 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 289 transitions. Word has length 24 [2024-11-20 14:40:29,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:29,884 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 289 transitions. [2024-11-20 14:40:29,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:29,885 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 289 transitions. [2024-11-20 14:40:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:40:29,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:29,885 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:29,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 14:40:30,089 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,SelfDestructingSolverStorable12 [2024-11-20 14:40:30,090 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:30,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:30,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1857961464, now seen corresponding path program 2 times [2024-11-20 14:40:30,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:30,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125581897] [2024-11-20 14:40:30,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:30,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:30,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:30,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125581897] [2024-11-20 14:40:30,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125581897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:30,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671742815] [2024-11-20 14:40:30,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:40:30,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:30,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:30,584 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-20 14:40:30,585 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-20 14:40:30,694 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:40:30,695 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:40:30,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-20 14:40:30,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:40:30,712 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-20 14:40:30,716 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-20 14:40:30,720 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-20 14:40:30,744 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-20 14:40:30,756 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-20 14:40:30,876 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 14:40:30,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-20 14:40:30,882 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-20 14:40:30,995 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 14:40:30,995 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-20 14:40:31,003 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-20 14:40:31,065 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-20 14:40:31,074 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-20 14:40:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:31,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:40:31,202 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse1 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_296) 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_295) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_296 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_296) c_create_data_~data~0.base) .cse0) .cse1 4))))) is different from false [2024-11-20 14:40:31,224 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_296 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1) .cse2 4))) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_295) c_create_data_~data~0.base) .cse1))))))) is different from false [2024-11-20 14:40:31,244 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_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_295) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_296 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1) .cse2 8)))))) is different from false [2024-11-20 14:40:31,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4)) (.cse2 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_293))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_294) .cse0 v_ArrVal_296) c_create_data_~data~0.base) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_295) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem8.base| v_ArrVal_294) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem8.base| v_ArrVal_293) c_create_data_~data~0.base) .cse1) v_ArrVal_296) c_create_data_~data~0.base) .cse1) .cse2 8))))) is different from false [2024-11-20 14:40:31,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_294) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_293) c_create_data_~data~0.base) .cse2) v_ArrVal_296) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_293))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_294) .cse3 v_ArrVal_296) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_295) c_create_data_~data~0.base) .cse2))))))))) is different from false [2024-11-20 14:40:31,330 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_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_294) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_293) c_create_data_~data~0.base) .cse1) v_ArrVal_296) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_293))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_294) .cse2 v_ArrVal_296) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_295) c_create_data_~data~0.base) .cse1))))))))) is different from false [2024-11-20 14:40:31,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:31,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2024-11-20 14:40:31,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:31,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-20 14:40:31,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2024-11-20 14:40:31,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 116 [2024-11-20 14:40:31,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-20 14:40:31,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 14:40:31,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-20 14:40:31,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:31,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-20 14:40:31,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:31,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-20 14:40:31,410 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:31,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2024-11-20 14:40:31,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:31,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-20 14:40:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-20 14:40:31,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671742815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:40:31,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:40:31,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 28 [2024-11-20 14:40:31,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907923361] [2024-11-20 14:40:31,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:40:31,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-20 14:40:31,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:31,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-20 14:40:31,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=421, Unknown=6, NotChecked=282, Total=812 [2024-11-20 14:40:31,448 INFO L87 Difference]: Start difference. First operand 249 states and 289 transitions. Second operand has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:32,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:32,316 INFO L93 Difference]: Finished difference Result 261 states and 301 transitions. [2024-11-20 14:40:32,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:40:32,316 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-20 14:40:32,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:32,318 INFO L225 Difference]: With dead ends: 261 [2024-11-20 14:40:32,318 INFO L226 Difference]: Without dead ends: 261 [2024-11-20 14:40:32,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=574, Unknown=6, NotChecked=330, Total=1056 [2024-11-20 14:40:32,319 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 11 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 582 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:32,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2004 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1252 Invalid, 0 Unknown, 582 Unchecked, 0.7s Time] [2024-11-20 14:40:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-20 14:40:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-11-20 14:40:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 197 states have (on average 1.5076142131979695) internal successors, (297), 256 states have internal predecessors, (297), 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-20 14:40:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 301 transitions. [2024-11-20 14:40:32,324 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 301 transitions. Word has length 30 [2024-11-20 14:40:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:32,324 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 301 transitions. [2024-11-20 14:40:32,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 301 transitions. [2024-11-20 14:40:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-20 14:40:32,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:32,326 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:32,335 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-20 14:40:32,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:32,530 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:32,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:32,530 INFO L85 PathProgramCache]: Analyzing trace with hash -706243316, now seen corresponding path program 3 times [2024-11-20 14:40:32,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:32,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834100649] [2024-11-20 14:40:32,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:32,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:32,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:32,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834100649] [2024-11-20 14:40:32,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834100649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:32,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778880285] [2024-11-20 14:40:32,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 14:40:32,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:32,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:32,622 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-20 14:40:32,623 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-20 14:40:32,750 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-20 14:40:32,751 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:40:32,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:40:32,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:40:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:32,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:40:32,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778880285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:32,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:40:32,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-20 14:40:32,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951376087] [2024-11-20 14:40:32,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:32,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:40:32,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:32,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:40:32,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:32,792 INFO L87 Difference]: Start difference. First operand 261 states and 301 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-20 14:40:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:32,812 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2024-11-20 14:40:32,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:32,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 36 [2024-11-20 14:40:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:32,814 INFO L225 Difference]: With dead ends: 254 [2024-11-20 14:40:32,814 INFO L226 Difference]: Without dead ends: 254 [2024-11-20 14:40:32,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:32,815 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:32,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:40:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-20 14:40:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-20 14:40:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 191 states have (on average 1.5026178010471205) internal successors, (287), 249 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-20 14:40:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 291 transitions. [2024-11-20 14:40:32,822 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 291 transitions. Word has length 36 [2024-11-20 14:40:32,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:32,822 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 291 transitions. [2024-11-20 14:40:32,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-20 14:40:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 291 transitions. [2024-11-20 14:40:32,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-20 14:40:32,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:32,824 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:32,834 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-20 14:40:33,025 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-20 14:40:33,026 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:33,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:33,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1015747616, now seen corresponding path program 1 times [2024-11-20 14:40:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:33,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831684282] [2024-11-20 14:40:33,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:33,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:33,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:33,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831684282] [2024-11-20 14:40:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831684282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:33,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:33,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:40:33,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914861980] [2024-11-20 14:40:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:33,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:40:33,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:33,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:40:33,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:40:33,104 INFO L87 Difference]: Start difference. First operand 254 states and 291 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-20 14:40:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:33,190 INFO L93 Difference]: Finished difference Result 250 states and 279 transitions. [2024-11-20 14:40:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:40:33,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-20 14:40:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:33,191 INFO L225 Difference]: With dead ends: 250 [2024-11-20 14:40:33,191 INFO L226 Difference]: Without dead ends: 250 [2024-11-20 14:40:33,192 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-20 14:40:33,192 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 14 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:33,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 242 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-20 14:40:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-11-20 14:40:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 191 states have (on average 1.4397905759162304) internal successors, (275), 245 states have internal predecessors, (275), 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-20 14:40:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 279 transitions. [2024-11-20 14:40:33,198 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 279 transitions. Word has length 45 [2024-11-20 14:40:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:33,198 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 279 transitions. [2024-11-20 14:40:33,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-20 14:40:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 279 transitions. [2024-11-20 14:40:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-20 14:40:33,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:33,202 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:33,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 14:40:33,202 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:33,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:33,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1015747615, now seen corresponding path program 1 times [2024-11-20 14:40:33,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:33,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804555260] [2024-11-20 14:40:33,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:33,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:33,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:33,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804555260] [2024-11-20 14:40:33,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804555260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:33,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:33,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:40:33,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571927673] [2024-11-20 14:40:33,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:33,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:40:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:33,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:40:33,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:40:33,336 INFO L87 Difference]: Start difference. First operand 250 states and 279 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-20 14:40:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:33,422 INFO L93 Difference]: Finished difference Result 246 states and 267 transitions. [2024-11-20 14:40:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:40:33,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-20 14:40:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:33,424 INFO L225 Difference]: With dead ends: 246 [2024-11-20 14:40:33,424 INFO L226 Difference]: Without dead ends: 246 [2024-11-20 14:40:33,424 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-20 14:40:33,425 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:33,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 241 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-20 14:40:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-20 14:40:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 241 states have internal predecessors, (263), 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-20 14:40:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 267 transitions. [2024-11-20 14:40:33,430 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 267 transitions. Word has length 45 [2024-11-20 14:40:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 267 transitions. [2024-11-20 14:40:33,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-20 14:40:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 267 transitions. [2024-11-20 14:40:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-20 14:40:33,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:33,434 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:33,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 14:40:33,434 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:33,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2093501139, now seen corresponding path program 1 times [2024-11-20 14:40:33,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:33,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328742737] [2024-11-20 14:40:33,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:33,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:33,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:33,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:33,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328742737] [2024-11-20 14:40:33,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328742737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:33,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:33,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 14:40:33,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085665215] [2024-11-20 14:40:33,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:33,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:40:33,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:33,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:40:33,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:40:33,996 INFO L87 Difference]: Start difference. First operand 246 states and 267 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:34,275 INFO L93 Difference]: Finished difference Result 266 states and 289 transitions. [2024-11-20 14:40:34,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:40:34,276 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-11-20 14:40:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:34,277 INFO L225 Difference]: With dead ends: 266 [2024-11-20 14:40:34,278 INFO L226 Difference]: Without dead ends: 266 [2024-11-20 14:40:34,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:40:34,278 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 72 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:34,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 345 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:40:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-20 14:40:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 257. [2024-11-20 14:40:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 199 states have (on average 1.3718592964824121) internal successors, (273), 249 states have internal predecessors, (273), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 14:40:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 280 transitions. [2024-11-20 14:40:34,284 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 280 transitions. Word has length 48 [2024-11-20 14:40:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:34,284 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 280 transitions. [2024-11-20 14:40:34,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 280 transitions. [2024-11-20 14:40:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-20 14:40:34,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:34,292 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:34,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 14:40:34,292 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:34,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:34,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2093501140, now seen corresponding path program 1 times [2024-11-20 14:40:34,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:34,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857932803] [2024-11-20 14:40:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:34,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:34,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:34,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857932803] [2024-11-20 14:40:34,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857932803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:34,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:34,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:40:34,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992969067] [2024-11-20 14:40:34,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:34,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:40:34,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:34,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:40:34,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:40:34,633 INFO L87 Difference]: Start difference. First operand 257 states and 280 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:34,981 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2024-11-20 14:40:34,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:40:34,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-11-20 14:40:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:34,983 INFO L225 Difference]: With dead ends: 257 [2024-11-20 14:40:34,983 INFO L226 Difference]: Without dead ends: 257 [2024-11-20 14:40:34,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:40:34,983 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 37 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:34,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 496 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:40:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-20 14:40:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2024-11-20 14:40:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 197 states have (on average 1.365482233502538) internal successors, (269), 247 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 275 transitions. [2024-11-20 14:40:34,988 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 275 transitions. Word has length 48 [2024-11-20 14:40:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:34,989 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 275 transitions. [2024-11-20 14:40:34,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 275 transitions. [2024-11-20 14:40:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 14:40:34,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:34,990 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:34,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 14:40:34,990 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:34,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1809896805, now seen corresponding path program 1 times [2024-11-20 14:40:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:34,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269609476] [2024-11-20 14:40:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:34,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:35,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:35,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:35,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269609476] [2024-11-20 14:40:35,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269609476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:35,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:35,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:40:35,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793800570] [2024-11-20 14:40:35,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:35,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:40:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:35,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:40:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:40:35,339 INFO L87 Difference]: Start difference. First operand 254 states and 275 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:35,753 INFO L93 Difference]: Finished difference Result 259 states and 281 transitions. [2024-11-20 14:40:35,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:40:35,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2024-11-20 14:40:35,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:35,755 INFO L225 Difference]: With dead ends: 259 [2024-11-20 14:40:35,755 INFO L226 Difference]: Without dead ends: 259 [2024-11-20 14:40:35,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:40:35,756 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 31 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:35,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 554 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:40:35,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-20 14:40:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2024-11-20 14:40:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 200 states have (on average 1.365) internal successors, (273), 250 states have internal predecessors, (273), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 279 transitions. [2024-11-20 14:40:35,761 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 279 transitions. Word has length 50 [2024-11-20 14:40:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:35,761 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 279 transitions. [2024-11-20 14:40:35,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 279 transitions. [2024-11-20 14:40:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 14:40:35,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:35,762 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:35,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 14:40:35,763 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:35,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:35,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1809896804, now seen corresponding path program 1 times [2024-11-20 14:40:35,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:35,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481254739] [2024-11-20 14:40:35,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:35,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:36,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:36,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:36,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481254739] [2024-11-20 14:40:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481254739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:36,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:36,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:40:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164084979] [2024-11-20 14:40:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:36,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:40:36,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:36,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:40:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:40:36,406 INFO L87 Difference]: Start difference. First operand 257 states and 279 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:36,808 INFO L93 Difference]: Finished difference Result 261 states and 282 transitions. [2024-11-20 14:40:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:40:36,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2024-11-20 14:40:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:36,809 INFO L225 Difference]: With dead ends: 261 [2024-11-20 14:40:36,810 INFO L226 Difference]: Without dead ends: 261 [2024-11-20 14:40:36,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:40:36,810 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 167 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:36,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 475 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:40:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-20 14:40:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 256. [2024-11-20 14:40:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 200 states have (on average 1.355) internal successors, (271), 249 states have internal predecessors, (271), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2024-11-20 14:40:36,816 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 50 [2024-11-20 14:40:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:36,816 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2024-11-20 14:40:36,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2024-11-20 14:40:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-20 14:40:36,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:36,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:36,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 14:40:36,817 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:36,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:36,818 INFO L85 PathProgramCache]: Analyzing trace with hash 150930076, now seen corresponding path program 1 times [2024-11-20 14:40:36,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:36,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19395950] [2024-11-20 14:40:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:36,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:36,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:36,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:36,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19395950] [2024-11-20 14:40:36,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19395950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:36,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:36,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:40:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388269520] [2024-11-20 14:40:36,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:36,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:40:36,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:36,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:40:36,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:40:36,963 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:37,150 INFO L93 Difference]: Finished difference Result 260 states and 281 transitions. [2024-11-20 14:40:37,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:37,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2024-11-20 14:40:37,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:37,152 INFO L225 Difference]: With dead ends: 260 [2024-11-20 14:40:37,152 INFO L226 Difference]: Without dead ends: 260 [2024-11-20 14:40:37,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-20 14:40:37,153 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 87 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:37,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 317 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-20 14:40:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 255. [2024-11-20 14:40:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 200 states have (on average 1.35) internal successors, (270), 248 states have internal predecessors, (270), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 276 transitions. [2024-11-20 14:40:37,158 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 276 transitions. Word has length 52 [2024-11-20 14:40:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:37,158 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 276 transitions. [2024-11-20 14:40:37,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 276 transitions. [2024-11-20 14:40:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-20 14:40:37,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:37,159 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:37,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 14:40:37,159 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:37,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:37,159 INFO L85 PathProgramCache]: Analyzing trace with hash 150930077, now seen corresponding path program 1 times [2024-11-20 14:40:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:37,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823084268] [2024-11-20 14:40:37,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:37,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:37,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:37,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:37,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823084268] [2024-11-20 14:40:37,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823084268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:37,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:37,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:40:37,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928061977] [2024-11-20 14:40:37,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:37,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:40:37,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:37,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:40:37,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:37,367 INFO L87 Difference]: Start difference. First operand 255 states and 276 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:37,561 INFO L93 Difference]: Finished difference Result 252 states and 273 transitions. [2024-11-20 14:40:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:40:37,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2024-11-20 14:40:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:37,563 INFO L225 Difference]: With dead ends: 252 [2024-11-20 14:40:37,563 INFO L226 Difference]: Without dead ends: 252 [2024-11-20 14:40:37,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:40:37,564 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 175 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:37,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 312 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-20 14:40:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 247. [2024-11-20 14:40:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 200 states have (on average 1.31) internal successors, (262), 240 states have internal predecessors, (262), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 268 transitions. [2024-11-20 14:40:37,570 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 268 transitions. Word has length 52 [2024-11-20 14:40:37,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:37,570 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 268 transitions. [2024-11-20 14:40:37,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 268 transitions. [2024-11-20 14:40:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-20 14:40:37,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:37,571 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:37,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 14:40:37,571 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:37,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:37,572 INFO L85 PathProgramCache]: Analyzing trace with hash 383865214, now seen corresponding path program 1 times [2024-11-20 14:40:37,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:37,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616487412] [2024-11-20 14:40:37,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:37,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:37,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:37,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:37,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616487412] [2024-11-20 14:40:37,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616487412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:37,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:37,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:40:37,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880268303] [2024-11-20 14:40:37,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:37,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:40:37,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:37,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:40:37,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:37,771 INFO L87 Difference]: Start difference. First operand 247 states and 268 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:38,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:38,054 INFO L93 Difference]: Finished difference Result 274 states and 298 transitions. [2024-11-20 14:40:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:40:38,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2024-11-20 14:40:38,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:38,055 INFO L225 Difference]: With dead ends: 274 [2024-11-20 14:40:38,056 INFO L226 Difference]: Without dead ends: 274 [2024-11-20 14:40:38,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:40:38,056 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 83 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:38,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 494 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:40:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-20 14:40:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 246. [2024-11-20 14:40:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 200 states have (on average 1.305) internal successors, (261), 239 states have internal predecessors, (261), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 267 transitions. [2024-11-20 14:40:38,062 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 267 transitions. Word has length 53 [2024-11-20 14:40:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:38,062 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 267 transitions. [2024-11-20 14:40:38,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 267 transitions. [2024-11-20 14:40:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-20 14:40:38,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:38,063 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:38,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 14:40:38,063 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:38,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:38,064 INFO L85 PathProgramCache]: Analyzing trace with hash 383865215, now seen corresponding path program 1 times [2024-11-20 14:40:38,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:38,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569557412] [2024-11-20 14:40:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:38,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:38,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:38,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:38,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569557412] [2024-11-20 14:40:38,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569557412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:38,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:38,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:40:38,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744612337] [2024-11-20 14:40:38,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:38,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:40:38,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:40:38,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:38,378 INFO L87 Difference]: Start difference. First operand 246 states and 267 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:38,651 INFO L93 Difference]: Finished difference Result 288 states and 314 transitions. [2024-11-20 14:40:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:40:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2024-11-20 14:40:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:38,653 INFO L225 Difference]: With dead ends: 288 [2024-11-20 14:40:38,653 INFO L226 Difference]: Without dead ends: 288 [2024-11-20 14:40:38,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:40:38,653 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 104 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:38,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 430 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-20 14:40:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 245. [2024-11-20 14:40:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 200 states have (on average 1.3) internal successors, (260), 238 states have internal predecessors, (260), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 266 transitions. [2024-11-20 14:40:38,659 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 266 transitions. Word has length 53 [2024-11-20 14:40:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:38,660 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 266 transitions. [2024-11-20 14:40:38,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 266 transitions. [2024-11-20 14:40:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 14:40:38,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:38,661 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:38,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 14:40:38,661 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:38,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 990522756, now seen corresponding path program 1 times [2024-11-20 14:40:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:38,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926829046] [2024-11-20 14:40:38,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:38,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:38,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926829046] [2024-11-20 14:40:38,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926829046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:38,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:38,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:40:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224196946] [2024-11-20 14:40:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:38,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:40:38,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:38,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:40:38,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:40:38,769 INFO L87 Difference]: Start difference. First operand 245 states and 266 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:38,998 INFO L93 Difference]: Finished difference Result 272 states and 296 transitions. [2024-11-20 14:40:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:38,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2024-11-20 14:40:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:39,000 INFO L225 Difference]: With dead ends: 272 [2024-11-20 14:40:39,000 INFO L226 Difference]: Without dead ends: 272 [2024-11-20 14:40:39,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:39,001 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 60 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:39,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 450 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-20 14:40:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 244. [2024-11-20 14:40:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 200 states have (on average 1.295) internal successors, (259), 237 states have internal predecessors, (259), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 265 transitions. [2024-11-20 14:40:39,008 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 265 transitions. Word has length 57 [2024-11-20 14:40:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:39,008 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 265 transitions. [2024-11-20 14:40:39,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 265 transitions. [2024-11-20 14:40:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 14:40:39,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:39,010 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:39,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 14:40:39,012 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:39,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash 990522757, now seen corresponding path program 1 times [2024-11-20 14:40:39,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:39,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633020961] [2024-11-20 14:40:39,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:39,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:39,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:39,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:39,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633020961] [2024-11-20 14:40:39,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633020961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:39,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:39,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:40:39,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755967757] [2024-11-20 14:40:39,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:39,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:40:39,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:39,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:40:39,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:40:39,186 INFO L87 Difference]: Start difference. First operand 244 states and 265 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:39,409 INFO L93 Difference]: Finished difference Result 282 states and 306 transitions. [2024-11-20 14:40:39,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:39,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2024-11-20 14:40:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:39,410 INFO L225 Difference]: With dead ends: 282 [2024-11-20 14:40:39,414 INFO L226 Difference]: Without dead ends: 282 [2024-11-20 14:40:39,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:39,415 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 62 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:39,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 461 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-20 14:40:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 243. [2024-11-20 14:40:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 200 states have (on average 1.29) internal successors, (258), 236 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 264 transitions. [2024-11-20 14:40:39,421 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 264 transitions. Word has length 57 [2024-11-20 14:40:39,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:39,421 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 264 transitions. [2024-11-20 14:40:39,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 264 transitions. [2024-11-20 14:40:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 14:40:39,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:39,422 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:39,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 14:40:39,423 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:39,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash 641434531, now seen corresponding path program 1 times [2024-11-20 14:40:39,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:39,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080213726] [2024-11-20 14:40:39,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:39,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:39,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:39,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:39,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080213726] [2024-11-20 14:40:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080213726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:39,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:39,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:40:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856459598] [2024-11-20 14:40:39,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:39,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:40:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:39,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:40:39,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:40:39,815 INFO L87 Difference]: Start difference. First operand 243 states and 264 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:40,284 INFO L93 Difference]: Finished difference Result 285 states and 310 transitions. [2024-11-20 14:40:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:40:40,284 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2024-11-20 14:40:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:40,286 INFO L225 Difference]: With dead ends: 285 [2024-11-20 14:40:40,286 INFO L226 Difference]: Without dead ends: 285 [2024-11-20 14:40:40,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:40:40,286 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 77 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:40,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 722 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:40:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-20 14:40:40,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 252. [2024-11-20 14:40:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 209 states have (on average 1.2870813397129186) internal successors, (269), 245 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 275 transitions. [2024-11-20 14:40:40,292 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 275 transitions. Word has length 58 [2024-11-20 14:40:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:40,292 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 275 transitions. [2024-11-20 14:40:40,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 275 transitions. [2024-11-20 14:40:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 14:40:40,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:40,293 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:40,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-20 14:40:40,294 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:40,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:40,294 INFO L85 PathProgramCache]: Analyzing trace with hash 641434532, now seen corresponding path program 1 times [2024-11-20 14:40:40,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:40,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649139508] [2024-11-20 14:40:40,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:40,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:40,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:40,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649139508] [2024-11-20 14:40:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649139508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:40,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 14:40:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701436666] [2024-11-20 14:40:40,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:40,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:40:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:40,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:40:40,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:40:40,836 INFO L87 Difference]: Start difference. First operand 252 states and 275 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:41,251 INFO L93 Difference]: Finished difference Result 297 states and 324 transitions. [2024-11-20 14:40:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:40:41,252 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2024-11-20 14:40:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:41,253 INFO L225 Difference]: With dead ends: 297 [2024-11-20 14:40:41,253 INFO L226 Difference]: Without dead ends: 297 [2024-11-20 14:40:41,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:40:41,254 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 125 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:41,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 805 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:40:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-20 14:40:41,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 252. [2024-11-20 14:40:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 209 states have (on average 1.2822966507177034) internal successors, (268), 245 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 274 transitions. [2024-11-20 14:40:41,259 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 274 transitions. Word has length 58 [2024-11-20 14:40:41,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:41,259 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 274 transitions. [2024-11-20 14:40:41,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:40:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 274 transitions. [2024-11-20 14:40:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 14:40:41,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:41,260 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 14:40:41,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-20 14:40:41,261 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting create_dataErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:41,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:41,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1949602115, now seen corresponding path program 1 times [2024-11-20 14:40:41,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:41,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418195837] [2024-11-20 14:40:41,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:41,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:41,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:41,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418195837] [2024-11-20 14:40:41,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418195837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:41,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266918114] [2024-11-20 14:40:41,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:41,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:41,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:41,411 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-20 14:40:41,412 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-20 14:40:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:41,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 14:40:41,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:40:41,637 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-20 14:40:41,663 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 14:40:41,664 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 12 treesize of output 14 [2024-11-20 14:40:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:41,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:40:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:41,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266918114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:40:41,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:40:41,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-20 14:40:41,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405208876] [2024-11-20 14:40:41,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:40:41,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:40:41,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:41,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:40:41,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:40:41,704 INFO L87 Difference]: Start difference. First operand 252 states and 274 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-20 14:40:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:41,846 INFO L93 Difference]: Finished difference Result 251 states and 272 transitions. [2024-11-20 14:40:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:40:41,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2024-11-20 14:40:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:41,847 INFO L225 Difference]: With dead ends: 251 [2024-11-20 14:40:41,847 INFO L226 Difference]: Without dead ends: 251 [2024-11-20 14:40:41,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:40:41,848 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 39 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:41,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 310 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-20 14:40:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-20 14:40:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 209 states have (on average 1.2727272727272727) internal successors, (266), 244 states have internal predecessors, (266), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 272 transitions. [2024-11-20 14:40:41,854 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 272 transitions. Word has length 58 [2024-11-20 14:40:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:41,855 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 272 transitions. [2024-11-20 14:40:41,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-20 14:40:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 272 transitions. [2024-11-20 14:40:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 14:40:41,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:41,856 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 14:40:41,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 14:40:42,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:42,057 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting create_dataErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:42,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1949602116, now seen corresponding path program 1 times [2024-11-20 14:40:42,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:42,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252830936] [2024-11-20 14:40:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:42,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:42,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:42,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252830936] [2024-11-20 14:40:42,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252830936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:42,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599549605] [2024-11-20 14:40:42,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:42,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:42,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:42,336 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:40:42,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 14:40:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:42,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 14:40:42,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:40:42,621 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-20 14:40:42,625 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-20 14:40:42,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:40:42,766 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-20 14:40:42,775 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:40:42,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 14:40:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:42,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:40:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:43,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599549605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:40:43,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:40:43,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-11-20 14:40:43,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277528192] [2024-11-20 14:40:43,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:40:43,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:40:43,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:43,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:40:43,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:40:43,037 INFO L87 Difference]: Start difference. First operand 251 states and 272 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 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-20 14:40:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:43,352 INFO L93 Difference]: Finished difference Result 247 states and 264 transitions. [2024-11-20 14:40:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:40:43,353 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 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 58 [2024-11-20 14:40:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:43,355 INFO L225 Difference]: With dead ends: 247 [2024-11-20 14:40:43,355 INFO L226 Difference]: Without dead ends: 247 [2024-11-20 14:40:43,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:40:43,356 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 71 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:43,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 583 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:40:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-20 14:40:43,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2024-11-20 14:40:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 195 states have (on average 1.2512820512820513) internal successors, (244), 226 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 14:40:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 250 transitions. [2024-11-20 14:40:43,363 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 250 transitions. Word has length 58 [2024-11-20 14:40:43,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:43,363 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 250 transitions. [2024-11-20 14:40:43,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 12 states have internal predecessors, (75), 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-20 14:40:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 250 transitions. [2024-11-20 14:40:43,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-20 14:40:43,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:43,364 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 14:40:43,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 14:40:43,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:43,565 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:43,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:43,566 INFO L85 PathProgramCache]: Analyzing trace with hash 960942337, now seen corresponding path program 1 times [2024-11-20 14:40:43,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:43,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809437021] [2024-11-20 14:40:43,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:43,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:43,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:44,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:44,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809437021] [2024-11-20 14:40:44,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809437021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:44,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696615553] [2024-11-20 14:40:44,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:44,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:44,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:44,664 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:40:44,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 14:40:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:44,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-20 14:40:44,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:40:44,908 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-20 14:40:44,913 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-20 14:40:45,005 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-20 14:40:45,057 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 72 treesize of output 36 [2024-11-20 14:40:45,068 WARN L873 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= (select |c_old(#valid)| create_data_~data~0.base) 0) (= |c_#valid| (store .cse0 |c_create_data_#t~mem8.base| (select |c_#valid| |c_create_data_#t~mem8.base|))) (= (select .cse0 |c_create_data_#t~mem8.base|) 0) (= (store (store |c_old(#length)| create_data_~data~0.base (select |c_#length| create_data_~data~0.base)) |c_create_data_#t~mem8.base| (select |c_#length| |c_create_data_#t~mem8.base|)) |c_#length|)))) is different from true [2024-11-20 14:40:45,425 WARN L873 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (create_data_~nextData~0.base Int) (|v_create_data_#t~mem8.base_21| Int)) (and (= (store (store (store |c_old(#length)| create_data_~data~0.base (select |c_#length| create_data_~data~0.base)) |v_create_data_#t~mem8.base_21| (select |c_#length| |v_create_data_#t~mem8.base_21|)) create_data_~nextData~0.base (select |c_#length| create_data_~nextData~0.base)) |c_#length|) (= (select |c_old(#valid)| create_data_~data~0.base) 0) (= (select |c_old(#valid)| |v_create_data_#t~mem8.base_21|) 0) (not (= create_data_~data~0.base |v_create_data_#t~mem8.base_21|)) (= (select (store (store |c_old(#valid)| create_data_~data~0.base 1) |v_create_data_#t~mem8.base_21| 1) create_data_~nextData~0.base) 0))) is different from true [2024-11-20 14:40:45,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:40:45,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:40:45,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:40:45,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:40:45,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:40:45,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2024-11-20 14:40:45,625 INFO L349 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2024-11-20 14:40:45,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 33 [2024-11-20 14:40:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-20 14:40:45,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:40:45,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696615553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:45,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:40:45,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2024-11-20 14:40:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321176202] [2024-11-20 14:40:45,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:40:45,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 14:40:45,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:45,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 14:40:45,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=202, Unknown=2, NotChecked=58, Total=306 [2024-11-20 14:40:45,839 INFO L87 Difference]: Start difference. First operand 233 states and 250 transitions. Second operand has 16 states, 15 states have (on average 5.733333333333333) internal successors, (86), 14 states have internal predecessors, (86), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:40:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:47,161 INFO L93 Difference]: Finished difference Result 272 states and 293 transitions. [2024-11-20 14:40:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:40:47,161 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.733333333333333) internal successors, (86), 14 states have internal predecessors, (86), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2024-11-20 14:40:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:47,163 INFO L225 Difference]: With dead ends: 272 [2024-11-20 14:40:47,163 INFO L226 Difference]: Without dead ends: 272 [2024-11-20 14:40:47,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=425, Unknown=2, NotChecked=86, Total=600 [2024-11-20 14:40:47,164 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 88 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:47,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 714 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 690 Invalid, 0 Unknown, 355 Unchecked, 0.8s Time] [2024-11-20 14:40:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-20 14:40:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 265. [2024-11-20 14:40:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 225 states have (on average 1.2355555555555555) internal successors, (278), 256 states have internal predecessors, (278), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 14:40:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 286 transitions. [2024-11-20 14:40:47,171 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 286 transitions. Word has length 60 [2024-11-20 14:40:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:47,171 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 286 transitions. [2024-11-20 14:40:47,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.733333333333333) internal successors, (86), 14 states have internal predecessors, (86), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:40:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 286 transitions. [2024-11-20 14:40:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-20 14:40:47,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:47,172 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 14:40:47,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-20 14:40:47,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:47,373 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:47,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash 960942336, now seen corresponding path program 1 times [2024-11-20 14:40:47,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:47,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692289879] [2024-11-20 14:40:47,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:47,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:47,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 14:40:48,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:48,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692289879] [2024-11-20 14:40:48,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692289879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:48,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816572686] [2024-11-20 14:40:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:48,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:48,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:48,267 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:40:48,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 14:40:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:48,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-20 14:40:48,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:40:48,521 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-20 14:40:48,572 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-20 14:40:48,597 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 38 treesize of output 20 [2024-11-20 14:40:49,219 INFO L349 Elim1Store]: treesize reduction 197, result has 30.6 percent of original size [2024-11-20 14:40:49,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 54 treesize of output 155 [2024-11-20 14:40:50,693 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:50,722 INFO L349 Elim1Store]: treesize reduction 145, result has 5.2 percent of original size [2024-11-20 14:40:50,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 33 [2024-11-20 14:40:50,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:50,743 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-20 14:40:50,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 22 [2024-11-20 14:40:50,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:50,771 INFO L349 Elim1Store]: treesize reduction 72, result has 11.1 percent of original size [2024-11-20 14:40:50,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 28 [2024-11-20 14:40:50,792 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:50,824 INFO L349 Elim1Store]: treesize reduction 157, result has 7.6 percent of original size [2024-11-20 14:40:50,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 40 treesize of output 35 [2024-11-20 14:40:50,837 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:50,902 INFO L349 Elim1Store]: treesize reduction 258, result has 11.3 percent of original size [2024-11-20 14:40:50,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 17 case distinctions, treesize of input 52 treesize of output 60 [2024-11-20 14:40:50,946 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:50,953 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-20 14:40:50,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 20 [2024-11-20 14:40:50,962 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:50,965 INFO L349 Elim1Store]: treesize reduction 8, result has 11.1 percent of original size [2024-11-20 14:40:50,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-11-20 14:40:50,980 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:50,987 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-20 14:40:50,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 20 [2024-11-20 14:40:51,002 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:51,017 INFO L349 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2024-11-20 14:40:51,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 25 [2024-11-20 14:40:51,082 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:51,115 INFO L349 Elim1Store]: treesize reduction 145, result has 5.2 percent of original size [2024-11-20 14:40:51,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 33 [2024-11-20 14:40:51,129 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:51,138 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-20 14:40:51,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 22 [2024-11-20 14:40:51,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:51,199 INFO L349 Elim1Store]: treesize reduction 149, result has 12.4 percent of original size [2024-11-20 14:40:51,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 42 treesize of output 45 [2024-11-20 14:40:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-20 14:40:51,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:40:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816572686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:51,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:40:51,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2024-11-20 14:40:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324860835] [2024-11-20 14:40:51,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:40:51,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 14:40:51,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:51,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 14:40:51,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-11-20 14:40:51,368 INFO L87 Difference]: Start difference. First operand 265 states and 286 transitions. Second operand has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:40:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:52,719 INFO L93 Difference]: Finished difference Result 267 states and 286 transitions. [2024-11-20 14:40:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:40:52,719 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2024-11-20 14:40:52,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:52,720 INFO L225 Difference]: With dead ends: 267 [2024-11-20 14:40:52,720 INFO L226 Difference]: Without dead ends: 267 [2024-11-20 14:40:52,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2024-11-20 14:40:52,721 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 175 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 20 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:52,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 643 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 662 Invalid, 22 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 14:40:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-20 14:40:52,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2024-11-20 14:40:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 225 states have (on average 1.2266666666666666) internal successors, (276), 256 states have internal predecessors, (276), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 14:40:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 284 transitions. [2024-11-20 14:40:52,725 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 284 transitions. Word has length 60 [2024-11-20 14:40:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:52,726 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 284 transitions. [2024-11-20 14:40:52,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:40:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 284 transitions. [2024-11-20 14:40:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-20 14:40:52,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:52,726 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 14:40:52,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 14:40:52,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-20 14:40:52,927 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-20 14:40:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash 47620463, now seen corresponding path program 1 times [2024-11-20 14:40:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887009480] [2024-11-20 14:40:52,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:52,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:53,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-20 14:40:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-20 14:40:53,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:53,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887009480] [2024-11-20 14:40:53,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887009480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:53,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476515556] [2024-11-20 14:40:53,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:53,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:53,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:53,877 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:40:53,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-20 14:40:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:54,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 14:40:54,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:40:54,142 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 5 treesize of output 3 [2024-11-20 14:40:54,177 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-20 14:40:54,202 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 35 treesize of output 17 [2024-11-20 14:40:54,207 WARN L873 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int)) (and (<= (+ create_data_~data~0.base 1) |c_#StackHeapBarrier|) (= |c_#valid| (store (store |c_old(#valid)| create_data_~data~0.base (select |c_#valid| create_data_~data~0.base)) |c_create_data_#t~mem8.base| (select |c_#valid| |c_create_data_#t~mem8.base|))))) is different from true [2024-11-20 14:40:54,375 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_14 Int) (create_data_~data~0.base Int) (|v_create_data_#t~mem8.base_40| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |v_create_data_#t~mem8.base_40| 1) create_data_~data~0.base 1)) (<= (+ create_data_~data~0.base 1) |c_#StackHeapBarrier|) (= (select (store (store |c_old(#valid)| create_data_~data~0.base v_DerPreprocessor_14) |v_create_data_#t~mem8.base_40| 1) create_data_~data~0.base) v_DerPreprocessor_14))) (exists ((create_data_~data~0.base Int) (create_data_~nextData~0.base Int) (|v_create_data_#t~mem8.base_40| Int)) (and (<= (+ create_data_~data~0.base 1) |c_#StackHeapBarrier|) (not (= create_data_~data~0.base create_data_~nextData~0.base)) (= |c_#valid| (store (store (store |c_old(#valid)| create_data_~data~0.base (select |c_#valid| create_data_~data~0.base)) |v_create_data_#t~mem8.base_40| 1) create_data_~nextData~0.base 1)) (not (= create_data_~data~0.base |v_create_data_#t~mem8.base_40|)))) (exists ((create_data_~data~0.base Int) (create_data_~nextData~0.base Int)) (and (= |c_#valid| (store (store |c_old(#valid)| create_data_~data~0.base 1) create_data_~nextData~0.base 1)) (<= (+ create_data_~data~0.base 1) |c_#StackHeapBarrier|)))) is different from true [2024-11-20 14:40:54,909 INFO L349 Elim1Store]: treesize reduction 176, result has 20.4 percent of original size [2024-11-20 14:40:54,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 190 [2024-11-20 14:40:55,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:40:55,183 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:55,184 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:55,185 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:55,185 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:55,186 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:55,186 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:55,233 INFO L349 Elim1Store]: treesize reduction 346, result has 0.3 percent of original size [2024-11-20 14:40:55,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 59 treesize of output 48 [2024-11-20 14:40:55,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:40:55,308 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:55,309 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:55,309 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:55,310 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:55,311 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:55,312 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:55,364 INFO L349 Elim1Store]: treesize reduction 305, result has 0.3 percent of original size [2024-11-20 14:40:55,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 59 treesize of output 48 [2024-11-20 14:40:56,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:40:56,300 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:56,372 INFO L349 Elim1Store]: treesize reduction 244, result has 8.3 percent of original size [2024-11-20 14:40:56,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 47 treesize of output 41 [2024-11-20 14:40:56,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:40:56,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:56,416 INFO L349 Elim1Store]: treesize reduction 151, result has 3.2 percent of original size [2024-11-20 14:40:56,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 20 [2024-11-20 14:41:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-20 14:41:04,177 INFO L311 TraceCheckSpWp]: Computing backward predicates...