./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:39:35,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:39:35,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:39:35,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:39:35,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:39:35,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:39:35,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:39:35,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:39:35,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:39:35,284 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:39:35,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:39:35,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:39:35,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:39:35,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:39:35,285 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:39:35,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:39:35,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:39:35,286 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 ! overflow) ) 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 -> 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 [2025-03-04 10:39:35,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:39:35,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:39:35,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:39:35,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:39:35,508 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:39:35,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2025-03-04 10:39:36,624 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf53170b/073aed023deb4b288c5ab750eab5450b/FLAGe3f4b0c2a [2025-03-04 10:39:36,932 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:39:36,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2025-03-04 10:39:36,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf53170b/073aed023deb4b288c5ab750eab5450b/FLAGe3f4b0c2a [2025-03-04 10:39:37,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bf53170b/073aed023deb4b288c5ab750eab5450b [2025-03-04 10:39:37,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:39:37,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:39:37,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:39:37,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:39:37,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:39:37,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea24f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37, skipping insertion in model container [2025-03-04 10:39:37,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:39:37,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:39:37,485 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:39:37,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:39:37,542 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:39:37,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37 WrapperNode [2025-03-04 10:39:37,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:39:37,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:39:37,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:39:37,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:39:37,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,576 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2025-03-04 10:39:37,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:39:37,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:39:37,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:39:37,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:39:37,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,608 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]. [2025-03-04 10:39:37,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:39:37,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:39:37,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:39:37,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:39:37,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (1/1) ... [2025-03-04 10:39:37,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:39:37,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:37,648 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) [2025-03-04 10:39:37,650 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 [2025-03-04 10:39:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:39:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:39:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:39:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:39:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:39:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:39:37,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-03-04 10:39:37,667 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:39:37,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:39:37,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:39:37,758 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:39:37,760 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:39:37,910 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc #t~mem5.base, #t~mem5.offset; [2025-03-04 10:39:37,985 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-03-04 10:39:38,000 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-04 10:39:38,001 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:39:38,007 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:39:38,007 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:39:38,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:39:38 BoogieIcfgContainer [2025-03-04 10:39:38,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:39:38,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:39:38,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:39:38,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:39:38,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:39:37" (1/3) ... [2025-03-04 10:39:38,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a77ed68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:39:38, skipping insertion in model container [2025-03-04 10:39:38,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:37" (2/3) ... [2025-03-04 10:39:38,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a77ed68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:39:38, skipping insertion in model container [2025-03-04 10:39:38,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:39:38" (3/3) ... [2025-03-04 10:39:38,017 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-1.i [2025-03-04 10:39:38,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:39:38,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test02-1.i that has 2 procedures, 49 locations, 1 initial locations, 5 loop locations, and 6 error locations. [2025-03-04 10:39:38,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:39:38,075 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=LoopHeads, 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;@583b7967, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:39:38,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:39:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 39 states have (on average 1.564102564102564) internal successors, (61), 45 states have internal predecessors, (61), 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) [2025-03-04 10:39:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:39:38,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:38,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:38,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:39:38,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:38,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1154415067, now seen corresponding path program 1 times [2025-03-04 10:39:38,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031724650] [2025-03-04 10:39:38,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:38,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:38,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:39:38,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:39:38,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:38,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:38,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:38,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031724650] [2025-03-04 10:39:38,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031724650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:39:38,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:39:38,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:39:38,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619833899] [2025-03-04 10:39:38,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:39:38,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:39:38,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:38,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:39:38,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:39:38,525 INFO L87 Difference]: Start difference. First operand has 49 states, 39 states have (on average 1.564102564102564) internal successors, (61), 45 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2025-03-04 10:39:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:38,575 INFO L93 Difference]: Finished difference Result 101 states and 139 transitions. [2025-03-04 10:39:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:39:38,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2025-03-04 10:39:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:38,580 INFO L225 Difference]: With dead ends: 101 [2025-03-04 10:39:38,581 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 10:39:38,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:39:38,584 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:38,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 164 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 10:39:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2025-03-04 10:39:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.457142857142857) internal successors, (51), 40 states have internal predecessors, (51), 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) [2025-03-04 10:39:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-03-04 10:39:38,628 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 11 [2025-03-04 10:39:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:38,629 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-03-04 10:39:38,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2025-03-04 10:39:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-03-04 10:39:38,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:39:38,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:38,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:38,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:39:38,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:39:38,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash 432081158, now seen corresponding path program 1 times [2025-03-04 10:39:38,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:38,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144723098] [2025-03-04 10:39:38,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:38,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:38,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:39:38,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:39:38,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:38,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:38,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144723098] [2025-03-04 10:39:38,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144723098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:39:38,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:39:38,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:39:38,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897809969] [2025-03-04 10:39:38,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:39:38,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:39:38,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:38,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:39:38,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:39:38,736 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2025-03-04 10:39:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:38,763 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2025-03-04 10:39:38,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:39:38,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2025-03-04 10:39:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:38,765 INFO L225 Difference]: With dead ends: 87 [2025-03-04 10:39:38,766 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 10:39:38,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:39:38,766 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:38,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 10:39:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 10:39:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 43 states have internal predecessors, (54), 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) [2025-03-04 10:39:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2025-03-04 10:39:38,773 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 11 [2025-03-04 10:39:38,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:38,774 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2025-03-04 10:39:38,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2025-03-04 10:39:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2025-03-04 10:39:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:39:38,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:38,774 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:38,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:39:38,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:39:38,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash 112790006, now seen corresponding path program 1 times [2025-03-04 10:39:38,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:38,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037370447] [2025-03-04 10:39:38,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:38,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:38,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:39:38,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:39:38,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:38,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:39:38,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:38,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037370447] [2025-03-04 10:39:38,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037370447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:39:38,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:39:38,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:39:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916651726] [2025-03-04 10:39:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:39:38,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:39:38,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:38,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:39:38,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:39:38,894 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.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) [2025-03-04 10:39:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:38,936 INFO L93 Difference]: Finished difference Result 122 states and 153 transitions. [2025-03-04 10:39:38,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:39:38,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.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 14 [2025-03-04 10:39:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:38,938 INFO L225 Difference]: With dead ends: 122 [2025-03-04 10:39:38,938 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 10:39:38,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:39:38,938 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 33 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:38,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 145 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 10:39:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2025-03-04 10:39:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 68 states have internal predecessors, (90), 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) [2025-03-04 10:39:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2025-03-04 10:39:38,947 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 14 [2025-03-04 10:39:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:38,947 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2025-03-04 10:39:38,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.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) [2025-03-04 10:39:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2025-03-04 10:39:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:39:38,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:38,949 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:38,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:39:38,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:39:38,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:38,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1855600341, now seen corresponding path program 1 times [2025-03-04 10:39:38,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:38,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976069738] [2025-03-04 10:39:38,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:38,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:38,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:39:38,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:39:38,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:38,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:39,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:39,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976069738] [2025-03-04 10:39:39,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976069738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:39:39,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520928212] [2025-03-04 10:39:39,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:39,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:39,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:39,047 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) [2025-03-04 10:39:39,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:39:39,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:39:39,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:39:39,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:39,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:39,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:39:39,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:39:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:39,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:39:39,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520928212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:39:39,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:39:39,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:39:39,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861974994] [2025-03-04 10:39:39,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:39:39,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:39:39,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:39,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:39:39,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:39:39,194 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:39,220 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2025-03-04 10:39:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:39:39,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 10:39:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:39,221 INFO L225 Difference]: With dead ends: 73 [2025-03-04 10:39:39,222 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 10:39:39,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:39:39,222 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:39,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 140 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 10:39:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 10:39:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 67 states have internal predecessors, (88), 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) [2025-03-04 10:39:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2025-03-04 10:39:39,229 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 14 [2025-03-04 10:39:39,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:39,230 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2025-03-04 10:39:39,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2025-03-04 10:39:39,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:39:39,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:39,230 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:39,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:39:39,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:39,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:39:39,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1689035721, now seen corresponding path program 1 times [2025-03-04 10:39:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:39,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900787604] [2025-03-04 10:39:39,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:39,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:39:39,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:39:39,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:39,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:39:39,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:39,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900787604] [2025-03-04 10:39:39,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900787604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:39:39,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:39:39,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:39:39,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364375671] [2025-03-04 10:39:39,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:39:39,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:39:39,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:39,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:39:39,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:39:39,488 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-03-04 10:39:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:39,494 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2025-03-04 10:39:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:39:39,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2025-03-04 10:39:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:39,495 INFO L225 Difference]: With dead ends: 72 [2025-03-04 10:39:39,496 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 10:39:39,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:39:39,496 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:39,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 10:39:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-03-04 10:39:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 62 states have internal predecessors, (82), 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) [2025-03-04 10:39:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2025-03-04 10:39:39,502 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 15 [2025-03-04 10:39:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:39,503 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2025-03-04 10:39:39,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-03-04 10:39:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2025-03-04 10:39:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:39:39,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:39,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:39,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:39:39,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:39:39,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:39,503 INFO L85 PathProgramCache]: Analyzing trace with hash 560067709, now seen corresponding path program 1 times [2025-03-04 10:39:39,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:39,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190306099] [2025-03-04 10:39:39,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:39,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:39,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:39:39,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:39:39,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:39,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:39,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:39,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190306099] [2025-03-04 10:39:39,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190306099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:39:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434701745] [2025-03-04 10:39:39,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:39,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:39,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:39,603 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) [2025-03-04 10:39:39,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:39:39,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:39:39,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:39:39,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:39,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:39,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:39:39,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:39:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:39,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:39:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:39,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434701745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:39:39,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:39:39,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:39:39,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540273047] [2025-03-04 10:39:39,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:39:39,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:39:39,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:39,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:39:39,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:39:39,750 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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) [2025-03-04 10:39:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:39,778 INFO L93 Difference]: Finished difference Result 142 states and 186 transitions. [2025-03-04 10:39:39,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:39:39,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 19 [2025-03-04 10:39:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:39,779 INFO L225 Difference]: With dead ends: 142 [2025-03-04 10:39:39,780 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 10:39:39,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:39:39,780 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:39,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 10:39:39,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-04 10:39:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.323943661971831) internal successors, (94), 74 states have internal predecessors, (94), 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) [2025-03-04 10:39:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2025-03-04 10:39:39,785 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 19 [2025-03-04 10:39:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:39,785 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2025-03-04 10:39:39,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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) [2025-03-04 10:39:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2025-03-04 10:39:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:39:39,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:39,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:39,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:39:39,987 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,SelfDestructingSolverStorable5 [2025-03-04 10:39:39,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:39:39,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1950116285, now seen corresponding path program 2 times [2025-03-04 10:39:39,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:39,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936967945] [2025-03-04 10:39:39,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:39:39,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:40,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:39:40,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 25 statements. [2025-03-04 10:39:40,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:39:40,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:39:40,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:40,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936967945] [2025-03-04 10:39:40,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936967945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:39:40,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:39:40,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:39:40,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296084512] [2025-03-04 10:39:40,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:39:40,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:39:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:40,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:39:40,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:39:40,081 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2025-03-04 10:39:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:40,139 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2025-03-04 10:39:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:39:40,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 25 [2025-03-04 10:39:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:40,140 INFO L225 Difference]: With dead ends: 107 [2025-03-04 10:39:40,140 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 10:39:40,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:39:40,141 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:40,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 10:39:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2025-03-04 10:39:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 86 states have internal predecessors, (112), 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) [2025-03-04 10:39:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2025-03-04 10:39:40,152 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 25 [2025-03-04 10:39:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:40,152 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2025-03-04 10:39:40,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2025-03-04 10:39:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2025-03-04 10:39:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:39:40,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:40,153 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:40,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:39:40,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:39:40,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash 324062673, now seen corresponding path program 1 times [2025-03-04 10:39:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:40,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248507507] [2025-03-04 10:39:40,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:40,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:39:40,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:39:40,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:40,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:39:40,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:40,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248507507] [2025-03-04 10:39:40,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248507507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:39:40,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:39:40,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:39:40,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447620612] [2025-03-04 10:39:40,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:39:40,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:39:40,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:40,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:39:40,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:39:40,309 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:40,369 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2025-03-04 10:39:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:39:40,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-04 10:39:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:40,370 INFO L225 Difference]: With dead ends: 106 [2025-03-04 10:39:40,370 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 10:39:40,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:39:40,371 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:40,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 123 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 10:39:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2025-03-04 10:39:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 88 states have internal predecessors, (114), 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) [2025-03-04 10:39:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2025-03-04 10:39:40,381 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 26 [2025-03-04 10:39:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:40,382 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2025-03-04 10:39:40,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2025-03-04 10:39:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:39:40,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:40,383 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:40,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:39:40,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:39:40,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:40,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2109400341, now seen corresponding path program 1 times [2025-03-04 10:39:40,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:40,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504712402] [2025-03-04 10:39:40,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:40,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:40,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:39:40,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:39:40,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:40,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:39:40,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:40,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504712402] [2025-03-04 10:39:40,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504712402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:39:40,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:39:40,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:39:40,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298775123] [2025-03-04 10:39:40,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:39:40,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:39:40,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:40,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:39:40,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:39:40,729 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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) [2025-03-04 10:39:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:40,832 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2025-03-04 10:39:40,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:39:40,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 10:39:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:40,833 INFO L225 Difference]: With dead ends: 127 [2025-03-04 10:39:40,834 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 10:39:40,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:39:40,834 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:40,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 128 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:39:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 10:39:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 103. [2025-03-04 10:39:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 98 states have internal predecessors, (126), 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) [2025-03-04 10:39:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2025-03-04 10:39:40,846 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 28 [2025-03-04 10:39:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:40,846 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2025-03-04 10:39:40,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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) [2025-03-04 10:39:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2025-03-04 10:39:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:39:40,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:40,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:40,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:39:40,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:39:40,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1393175822, now seen corresponding path program 1 times [2025-03-04 10:39:40,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:40,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309618367] [2025-03-04 10:39:40,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:40,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:39:40,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:39:40,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:40,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:39:41,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:41,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309618367] [2025-03-04 10:39:41,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309618367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:39:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465394978] [2025-03-04 10:39:41,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:41,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:41,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:41,509 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) [2025-03-04 10:39:41,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:39:41,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:39:41,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:39:41,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:41,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:41,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:39:41,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:39:41,693 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 15 treesize of output 1 [2025-03-04 10:39:41,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-03-04 10:39:41,777 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 [2025-03-04 10:39:41,811 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:39:41,812 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2025-03-04 10:39:41,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 124 [2025-03-04 10:39:41,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 17 treesize of output 8 [2025-03-04 10:39:41,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-03-04 10:39:42,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:39:42,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:39:42,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 223 [2025-03-04 10:39:42,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 191 [2025-03-04 10:39:42,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 147 [2025-03-04 10:39:42,191 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:39:42,191 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 [2025-03-04 10:39:42,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2025-03-04 10:39:42,321 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 5 [2025-03-04 10:39:42,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2025-03-04 10:39:42,356 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 28 treesize of output 26 [2025-03-04 10:39:42,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2025-03-04 10:39:42,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2025-03-04 10:39:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:39:42,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:39:43,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:39:43,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 376 treesize of output 447 [2025-03-04 10:39:55,746 INFO L349 Elim1Store]: treesize reduction 369, result has 35.4 percent of original size [2025-03-04 10:39:55,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 16 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 19 case distinctions, treesize of input 175 treesize of output 436 [2025-03-04 10:39:55,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-04 10:39:55,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-04 10:39:55,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-04 10:39:56,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-04 10:39:56,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-04 10:39:56,470 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:39:56,472 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:39:56,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:39:56,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 27 [2025-03-04 10:39:56,667 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:39:56,670 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:39:56,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:39:56,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 27 [2025-03-04 10:39:57,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_create_data_~data~0.offset 12)) (.cse14 (not (= c_create_data_~data~0.offset 12))) (.cse3 (+ c_create_data_~data~0.offset 8))) (and (forall ((v_ArrVal_606 (Array Int Int))) (or (forall ((v_create_data_~nextData~0.base_6 Int) (v_ArrVal_607 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_13 0)) (.cse0 (store (store |c_#memory_int#2| c_create_data_~data~0.base v_DerPreprocessor_12) v_create_data_~nextData~0.base_6 v_DerPreprocessor_13))) (or (= v_create_data_~nextData~0.base_6 c_create_data_~data~0.base) (< 0 (+ (select (select (store .cse0 v_prenex_21 v_prenex_22) v_create_data_~nextData~0.base_6) 0) 2147483449)) (= v_create_data_~nextData~0.base_6 v_prenex_21) (< (+ 200 .cse1) (select (select (store (store |c_#memory_int#2| c_create_data_~data~0.base v_ArrVal_606) v_create_data_~nextData~0.base_6 v_ArrVal_607) c_create_data_~data~0.base) c_create_data_~data~0.offset)) (not (= (store (store (store v_ArrVal_607 0 .cse1) 8 0) 12 (select v_DerPreprocessor_13 12)) v_DerPreprocessor_13)) (not (let ((.cse2 (select .cse0 c_create_data_~data~0.base))) (= .cse2 (store (store (store v_ArrVal_606 c_create_data_~data~0.offset 200) .cse3 (select .cse2 .cse3)) .cse4 (select .cse2 .cse4)))))))) (not (= v_ArrVal_606 (store (store (select |c_#memory_int#2| c_create_data_~data~0.base) .cse3 0) .cse4 (select v_ArrVal_606 .cse4)))))) (forall ((v_DerPreprocessor_36 Int) (v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_37 Int) (v_DerPreprocessor_38 Int) (v_DerPreprocessor_16 Int) (v_DerPreprocessor_20 Int) (v_DerPreprocessor_21 Int) (v_DerPreprocessor_40 Int) (v_DerPreprocessor_41 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse10 (store (store (store v_arrayElimArr_9 c_create_data_~data~0.offset v_DerPreprocessor_16) .cse3 v_DerPreprocessor_17) .cse4 v_DerPreprocessor_18)) (.cse9 (store (store (store v_arrayElimArr_9 c_create_data_~data~0.offset v_DerPreprocessor_36) .cse3 v_DerPreprocessor_37) .cse4 v_DerPreprocessor_38)) (.cse11 (select v_arrayElimArr_9 0))) (let ((.cse7 (store (store (store (store (store .cse9 0 .cse11) (- 4) 200) 4 v_DerPreprocessor_40) 8 0) 12 v_DerPreprocessor_41)) (.cse8 (store (store (store (store (store .cse10 0 .cse11) 4 200) 16 v_DerPreprocessor_20) 8 0) 12 v_DerPreprocessor_21))) (let ((.cse6 (select .cse8 c_create_data_~data~0.offset)) (.cse5 (select .cse7 c_create_data_~data~0.offset))) (or (not (= v_DerPreprocessor_36 .cse5)) (not (= (select v_arrayElimArr_9 8) 0)) (= c_create_data_~data~0.base v_prenex_18) (not (= .cse6 v_DerPreprocessor_16)) (not (= v_DerPreprocessor_37 (select .cse7 .cse3))) (< 0 (+ (select (select (store (store |c_#memory_int#2| c_create_data_~data~0.base v_arrayElimArr_9) v_prenex_18 v_prenex_19) c_create_data_~data~0.base) 0) 2147483449)) (not (= .cse8 (store (store (store (store (store (store .cse9 (- 4) (select .cse10 (- 4))) 0 .cse11) 4 200) 16 v_DerPreprocessor_20) 8 0) 12 v_DerPreprocessor_21))) (not (= v_DerPreprocessor_18 (select .cse8 .cse4))) (not (= .cse6 .cse5)) (< (+ 200 .cse11) .cse5) (not (= v_DerPreprocessor_17 (select .cse8 .cse3))) (not (= v_DerPreprocessor_38 (select .cse7 .cse4))) (not (= 200 (select v_arrayElimArr_9 c_create_data_~data~0.offset)))))))) (or (and (forall ((v_DerPreprocessor_36 Int) (v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_37 Int) (v_DerPreprocessor_38 Int) (v_DerPreprocessor_20 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse12 (select v_arrayElimArr_9 0))) (or (not (= (select v_arrayElimArr_9 8) 0)) (= c_create_data_~data~0.base v_prenex_18) (< 0 (+ (select (select (store (store |c_#memory_int#2| c_create_data_~data~0.base v_arrayElimArr_9) v_prenex_18 v_prenex_19) c_create_data_~data~0.base) 0) 2147483449)) (< (+ 200 .cse12) v_DerPreprocessor_36) (not (= (store (store (store (store (store (store (store v_arrayElimArr_9 20 v_DerPreprocessor_17) 24 v_DerPreprocessor_18) 0 .cse12) 4 200) 16 v_DerPreprocessor_20) 8 0) 12 v_DerPreprocessor_36) (store (store (store (store (store (store (store (store v_arrayElimArr_9 20 v_DerPreprocessor_37) 24 v_DerPreprocessor_38) (- 4) (select v_arrayElimArr_9 (- 4))) 0 .cse12) 4 200) 16 v_DerPreprocessor_20) 8 0) 12 v_DerPreprocessor_36)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 8) 0)) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int))) (or (= c_create_data_~data~0.base v_prenex_18) (< 0 (+ (select (select (store (store |c_#memory_int#2| c_create_data_~data~0.base v_arrayElimArr_9) v_prenex_18 v_prenex_19) c_create_data_~data~0.base) 0) 2147483449)))) (forall ((v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_16 Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_20 Int) (v_DerPreprocessor_32 Int)) (not (let ((.cse13 (select v_arrayElimArr_9 0))) (= (store (store (store (store (store (store (store (store v_arrayElimArr_9 20 v_DerPreprocessor_31) 24 v_DerPreprocessor_32) (- 4) (select v_arrayElimArr_9 (- 4))) 0 .cse13) 4 200) 16 v_DerPreprocessor_20) 8 0) 12 v_DerPreprocessor_16) (store (store (store (store (store (store (store v_arrayElimArr_9 20 v_DerPreprocessor_17) 24 v_DerPreprocessor_18) 0 .cse13) 4 200) 16 v_DerPreprocessor_20) 8 0) 12 v_DerPreprocessor_16)))))))) .cse14) (or (not (= .cse4 0)) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 (- 12)) 200)) (not (= (select v_arrayElimArr_9 8) 0)) (= c_create_data_~data~0.base v_prenex_18) (< 0 (+ (select (select (store (store |c_#memory_int#2| c_create_data_~data~0.base v_arrayElimArr_9) v_prenex_18 v_prenex_19) c_create_data_~data~0.base) 0) 2147483449))))) (or .cse14 (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_16 Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_20 Int) (v_arrayElimArr_9 (Array Int Int)) (v_DerPreprocessor_32 Int)) (or (not (let ((.cse15 (select v_arrayElimArr_9 0))) (= (store (store (store (store (store (store (store (store v_arrayElimArr_9 20 v_DerPreprocessor_31) 24 v_DerPreprocessor_32) (- 4) (select v_arrayElimArr_9 (- 4))) 0 .cse15) 4 200) 16 v_DerPreprocessor_20) 8 0) 12 v_DerPreprocessor_16) (store (store (store (store (store (store (store v_arrayElimArr_9 20 v_DerPreprocessor_17) 24 v_DerPreprocessor_18) 0 .cse15) 4 200) 16 v_DerPreprocessor_20) 8 0) 12 v_DerPreprocessor_16)))) (not (= (select v_arrayElimArr_9 8) 0)) (= c_create_data_~data~0.base v_prenex_18) (< 0 (+ (select (select (store (store |c_#memory_int#2| c_create_data_~data~0.base v_arrayElimArr_9) v_prenex_18 v_prenex_19) c_create_data_~data~0.base) 0) 2147483449)) (not (= (select v_arrayElimArr_9 12) 200))))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 8) 0)) (= c_create_data_~data~0.base v_prenex_18) (< 0 (+ (select (select (store (store |c_#memory_int#2| c_create_data_~data~0.base v_arrayElimArr_9) v_prenex_18 v_prenex_19) c_create_data_~data~0.base) 0) 2147483449)) (not (= (select v_arrayElimArr_9 (- 8)) 200)))) (not (= .cse3 0))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_27 Int) (v_arrayElimArr_9 (Array Int Int)) (v_DerPreprocessor_21 Int)) (or (not (= (select v_arrayElimArr_9 8) 0)) (= c_create_data_~data~0.base v_prenex_18) (< 0 (+ (select (select (store (store |c_#memory_int#2| c_create_data_~data~0.base v_arrayElimArr_9) v_prenex_18 v_prenex_19) c_create_data_~data~0.base) 0) 2147483449)) (not (let ((.cse16 (select v_arrayElimArr_9 0))) (= (store (store (store (store (store (store v_arrayElimArr_9 20 v_DerPreprocessor_18) 0 .cse16) 4 200) 16 v_DerPreprocessor_17) 8 0) 12 v_DerPreprocessor_21) (store (store (store (store (store (store (store v_arrayElimArr_9 20 v_DerPreprocessor_27) (- 4) (select v_arrayElimArr_9 (- 4))) 0 .cse16) 4 200) 16 v_DerPreprocessor_17) 8 0) 12 v_DerPreprocessor_21)))))) (not (= c_create_data_~data~0.offset 8))) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_prenex_12 Int) (v_prenex_13 (Array Int Int))) (or (= c_create_data_~data~0.base v_prenex_12) (< 0 (+ 2147483449 (select (select (store (store |c_#memory_int#2| c_create_data_~data~0.base v_arrayElimArr_8) v_prenex_12 v_prenex_13) c_create_data_~data~0.base) 0))) (not (= (select v_arrayElimArr_8 8) 0)) (not (= 200 (select v_arrayElimArr_8 (- 4)))))) (not (= (+ c_create_data_~data~0.offset 4) 0))) (or (not (= c_create_data_~data~0.offset 4)) (forall ((v_prenex_15 Int) (v_arrayElimArr_7 (Array Int Int)) (v_prenex_16 (Array Int Int))) (or (< 0 (+ 2147483449 (select (select (store (store |c_#memory_int#2| c_create_data_~data~0.base v_arrayElimArr_7) v_prenex_15 v_prenex_16) c_create_data_~data~0.base) 0))) (= c_create_data_~data~0.base v_prenex_15) (not (= (select v_arrayElimArr_7 8) 0)) (not (= 200 (select v_arrayElimArr_7 4)))))) (or (not (= 16 c_create_data_~data~0.offset)) (forall ((v_prenex_18 Int) (v_DerPreprocessor_44 Int) (v_prenex_19 (Array Int Int)) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_16 Int) (v_arrayElimArr_9 (Array Int Int)) (v_DerPreprocessor_43 Int) (v_DerPreprocessor_21 Int)) (or (not (= (select v_arrayElimArr_9 8) 0)) (= c_create_data_~data~0.base v_prenex_18) (< 0 (+ (select (select (store (store |c_#memory_int#2| c_create_data_~data~0.base v_arrayElimArr_9) v_prenex_18 v_prenex_19) c_create_data_~data~0.base) 0) 2147483449)) (not (let ((.cse17 (select v_arrayElimArr_9 0))) (= (store (store (store (store (store (store (store (store v_arrayElimArr_9 24 v_DerPreprocessor_43) 28 v_DerPreprocessor_44) (- 4) (select v_arrayElimArr_9 (- 4))) 0 .cse17) 4 200) 16 v_DerPreprocessor_16) 8 0) 12 v_DerPreprocessor_21) (store (store (store (store (store (store (store v_arrayElimArr_9 24 v_DerPreprocessor_17) 28 v_DerPreprocessor_18) 0 .cse17) 4 200) 16 v_DerPreprocessor_16) 8 0) 12 v_DerPreprocessor_21)))) (not (= 200 (select v_arrayElimArr_9 16)))))))) is different from false [2025-03-04 10:39:58,773 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 1259 treesize of output 1257 [2025-03-04 10:39:58,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:39:58,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 29 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 21 case distinctions, treesize of input 1028 treesize of output 1112 [2025-03-04 10:40:10,114 WARN L286 SmtUtils]: Spent 11.05s on a formula simplification. DAG size of input: 478 DAG size of output: 204 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-04 10:40:10,115 INFO L349 Elim1Store]: treesize reduction 2109, result has 25.1 percent of original size [2025-03-04 10:40:10,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 67 case distinctions, treesize of input 115967805 treesize of output 114876093 [2025-03-04 10:40:12,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:40:12,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 19 case distinctions, treesize of input 987 treesize of output 1062 [2025-03-04 10:40:12,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:40:12,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 23 case distinctions, treesize of input 940 treesize of output 1024 [2025-03-04 10:40:12,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 885 treesize of output 879 [2025-03-04 10:40:13,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 879 treesize of output 873 [2025-03-04 10:40:13,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:40:13,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 873 treesize of output 883 [2025-03-04 10:40:13,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:40:13,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 856 treesize of output 866 [2025-03-04 10:40:13,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 843 treesize of output 837 [2025-03-04 10:40:14,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:40:14,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 29 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 21 case distinctions, treesize of input 837 treesize of output 923 [2025-03-04 10:40:14,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:40:14,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 23 case distinctions, treesize of input 784 treesize of output 868 [2025-03-04 10:40:15,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 729 treesize of output 723 [2025-03-04 10:40:20,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:20,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:20,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:20,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:20,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:20,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:20,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:20,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:20,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:20,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:20,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:20,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:20,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:20,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:20,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:20,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:20,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:20,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:21,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:21,430 INFO L224 Elim1Store]: Index analysis took 113 ms [2025-03-04 10:40:21,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:21,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:21,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 33 [2025-03-04 10:40:21,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 33 [2025-03-04 10:40:21,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 33 [2025-03-04 10:40:21,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:21,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 33 [2025-03-04 10:40:21,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 33 [2025-03-04 10:40:22,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 33 [2025-03-04 10:40:22,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 33 [2025-03-04 10:40:22,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 33 [2025-03-04 10:40:22,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 33 [2025-03-04 10:40:22,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:22,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:22,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:23,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:23,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:23,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:23,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:23,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:23,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:23,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:23,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 33 [2025-03-04 10:40:23,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 392 treesize of output 382 [2025-03-04 10:40:23,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 311 [2025-03-04 10:40:23,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 309 [2025-03-04 10:40:24,878 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:40:24,895 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:40:24,933 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:40:25,216 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:40:25,227 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:40:25,824 INFO L224 Elim1Store]: Index analysis took 615 ms [2025-03-04 10:40:26,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:40:26,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:41:09,301 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-04 10:41:09,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-03-04 10:41:09,302 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-04 10:41:09,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:41:09,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:09,504 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:392) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:648) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 63 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 81 more [2025-03-04 10:41:09,509 INFO L158 Benchmark]: Toolchain (without parser) took 92306.59ms. Allocated memory was 167.8MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 122.3MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2025-03-04 10:41:09,509 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:41:09,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.19ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 104.2MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:41:09,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.19ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 102.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:41:09,509 INFO L158 Benchmark]: Boogie Preprocessor took 45.78ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 100.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:41:09,509 INFO L158 Benchmark]: IcfgBuilder took 383.81ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 77.5MB in the end (delta: 22.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:41:09,510 INFO L158 Benchmark]: TraceAbstraction took 91498.84ms. Allocated memory was 167.8MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 77.5MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2025-03-04 10:41:09,510 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.19ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 104.2MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.19ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 102.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.78ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 100.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 383.81ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 77.5MB in the end (delta: 22.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 91498.84ms. Allocated memory was 167.8MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 77.5MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:41:11,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:41:11,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2025-03-04 10:41:11,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:41:11,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:41:11,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:41:11,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:41:11,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:41:11,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:41:11,662 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:41:11,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:41:11,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:41:11,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:41:11,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:41:11,663 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:41:11,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:41:11,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:41:11,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:41:11,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:41:11,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:41:11,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:41:11,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 10:41:11,664 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 10:41:11,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:41:11,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:41:11,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:41:11,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:41:11,665 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 ! overflow) ) 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 -> 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 [2025-03-04 10:41:11,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:41:11,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:41:11,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:41:11,892 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:41:11,892 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:41:11,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i