./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:06:59,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:06:59,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:06:59,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:06:59,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:06:59,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:06:59,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:06:59,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:06:59,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:06:59,463 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:06:59,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:06:59,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:06:59,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:06:59,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:06:59,463 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:06:59,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:06:59,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:06:59,464 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:06:59,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:06:59,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:06:59,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:06:59,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:06:59,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:06:59,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:06:59,464 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:06:59,464 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:06:59,465 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:06:59,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:06:59,465 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:06:59,465 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:06:59,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:06:59,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:06:59,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:06:59,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:06:59,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:06:59,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:06:59,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:06:59,466 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:06:59,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:06:59,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:06:59,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:06:59,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:06:59,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:06:59,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:06:59,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:06:59,466 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-jdk21/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 -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2025-02-08 09:06:59,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:06:59,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:06:59,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:06:59,707 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:06:59,707 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:06:59,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2025-02-08 09:07:00,932 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4ff51303/be17f244b48e4234964fc9d365a39830/FLAG4db917197 [2025-02-08 09:07:01,170 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:07:01,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2025-02-08 09:07:01,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4ff51303/be17f244b48e4234964fc9d365a39830/FLAG4db917197 [2025-02-08 09:07:01,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4ff51303/be17f244b48e4234964fc9d365a39830 [2025-02-08 09:07:01,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:07:01,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:07:01,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:07:01,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:07:01,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:07:01,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf3d422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01, skipping insertion in model container [2025-02-08 09:07:01,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:07:01,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:07:01,416 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:07:01,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:07:01,483 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:07:01,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01 WrapperNode [2025-02-08 09:07:01,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:07:01,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:07:01,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:07:01,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:07:01,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,513 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2025-02-08 09:07:01,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:07:01,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:07:01,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:07:01,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:07:01,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,534 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [31, 2, 11]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [0, 2, 1]. The 18 writes are split as follows [16, 0, 2]. [2025-02-08 09:07:01,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:07:01,546 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:07:01,546 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:07:01,546 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:07:01,547 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (1/1) ... [2025-02-08 09:07:01,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:07:01,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:07:01,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 09:07:01,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 09:07:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 09:07:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 09:07:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 09:07:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 09:07:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 09:07:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 09:07:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 09:07:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-02-08 09:07:01,589 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-02-08 09:07:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:07:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 09:07:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:07:01,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:07:01,676 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:07:01,677 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:07:01,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc #t~mem5.base, #t~mem5.offset; [2025-02-08 09:07:01,905 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-02-08 09:07:01,919 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-02-08 09:07:01,920 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:07:01,928 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:07:01,928 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:07:01,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:07:01 BoogieIcfgContainer [2025-02-08 09:07:01,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:07:01,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:07:01,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:07:01,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:07:01,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:07:01" (1/3) ... [2025-02-08 09:07:01,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178158ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:07:01, skipping insertion in model container [2025-02-08 09:07:01,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:07:01" (2/3) ... [2025-02-08 09:07:01,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178158ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:07:01, skipping insertion in model container [2025-02-08 09:07:01,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:07:01" (3/3) ... [2025-02-08 09:07:01,936 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i [2025-02-08 09:07:01,947 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:07:01,948 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test01-2.i that has 2 procedures, 45 locations, 1 initial locations, 4 loop locations, and 6 error locations. [2025-02-08 09:07:01,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:07:01,995 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;@fa51c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:07:01,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 09:07:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 35 states have (on average 1.6) internal successors, (56), 41 states have internal predecessors, (56), 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-02-08 09:07:02,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 09:07:02,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:02,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:02,004 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-02-08 09:07:02,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -730355871, now seen corresponding path program 1 times [2025-02-08 09:07:02,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:02,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231685740] [2025-02-08 09:07:02,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:02,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:02,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 09:07:02,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 09:07:02,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:02,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:02,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:02,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231685740] [2025-02-08 09:07:02,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231685740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:07:02,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:07:02,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 09:07:02,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273804526] [2025-02-08 09:07:02,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:07:02,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:07:02,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:02,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:07:02,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:07:02,335 INFO L87 Difference]: Start difference. First operand has 45 states, 35 states have (on average 1.6) internal successors, (56), 41 states have internal predecessors, (56), 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.25) internal successors, (9), 3 states have internal predecessors, (9), 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-02-08 09:07:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:02,388 INFO L93 Difference]: Finished difference Result 117 states and 157 transitions. [2025-02-08 09:07:02,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:07:02,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2025-02-08 09:07:02,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:02,395 INFO L225 Difference]: With dead ends: 117 [2025-02-08 09:07:02,395 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 09:07:02,399 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-02-08 09:07:02,402 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 32 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 159 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-02-08 09:07:02,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 159 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:07:02,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 09:07:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2025-02-08 09:07:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 56 states have internal predecessors, (78), 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-02-08 09:07:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2025-02-08 09:07:02,436 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 10 [2025-02-08 09:07:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:02,438 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2025-02-08 09:07:02,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-02-08 09:07:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2025-02-08 09:07:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 09:07:02,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:02,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:02,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:07:02,439 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-02-08 09:07:02,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:02,440 INFO L85 PathProgramCache]: Analyzing trace with hash -729432350, now seen corresponding path program 1 times [2025-02-08 09:07:02,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:02,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678458098] [2025-02-08 09:07:02,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:02,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:02,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 09:07:02,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 09:07:02,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:02,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:02,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:02,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678458098] [2025-02-08 09:07:02,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678458098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:07:02,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:07:02,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:07:02,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439346119] [2025-02-08 09:07:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:07:02,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:07:02,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:02,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:07:02,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:07:02,537 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-02-08 09:07:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:02,573 INFO L93 Difference]: Finished difference Result 127 states and 177 transitions. [2025-02-08 09:07:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:07:02,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2025-02-08 09:07:02,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:02,576 INFO L225 Difference]: With dead ends: 127 [2025-02-08 09:07:02,577 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 09:07:02,577 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-02-08 09:07:02,578 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 137 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-02-08 09:07:02,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 137 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:07:02,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 09:07:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-08 09:07:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 62 states have internal predecessors, (84), 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-02-08 09:07:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 88 transitions. [2025-02-08 09:07:02,585 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 88 transitions. Word has length 10 [2025-02-08 09:07:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:02,585 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 88 transitions. [2025-02-08 09:07:02,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-02-08 09:07:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2025-02-08 09:07:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 09:07:02,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:02,586 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:02,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:07:02,586 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-02-08 09:07:02,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2015373078, now seen corresponding path program 1 times [2025-02-08 09:07:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:02,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134206311] [2025-02-08 09:07:02,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:02,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 09:07:02,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 09:07:02,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:02,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:02,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:02,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134206311] [2025-02-08 09:07:02,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134206311] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:07:02,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818166415] [2025-02-08 09:07:02,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:02,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:07:02,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:07:02,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:07:02,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 09:07:02,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 09:07:02,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 09:07:02,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:02,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:02,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:07:02,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:07:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:02,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:07:02,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818166415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:07:02,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:07:02,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 09:07:02,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233805975] [2025-02-08 09:07:02,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:07:02,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:07:02,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:02,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:07:02,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:07:02,868 INFO L87 Difference]: Start difference. First operand 67 states and 88 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-02-08 09:07:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:02,899 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2025-02-08 09:07:02,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:07:02,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-08 09:07:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:02,902 INFO L225 Difference]: With dead ends: 67 [2025-02-08 09:07:02,902 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 09:07:02,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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-02-08 09:07:02,902 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:02,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 174 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:07:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 09:07:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-08 09:07:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 61 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-02-08 09:07:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2025-02-08 09:07:02,907 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 13 [2025-02-08 09:07:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:02,907 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2025-02-08 09:07:02,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-02-08 09:07:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2025-02-08 09:07:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 09:07:02,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:02,907 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:02,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 09:07:03,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:07:03,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:07:03,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:03,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1947944028, now seen corresponding path program 1 times [2025-02-08 09:07:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:03,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515024187] [2025-02-08 09:07:03,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:03,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 09:07:03,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 09:07:03,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:03,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 09:07:03,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:03,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515024187] [2025-02-08 09:07:03,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515024187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:07:03,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:07:03,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:07:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386825336] [2025-02-08 09:07:03,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:07:03,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:07:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:03,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:07:03,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:07:03,183 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:07:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:03,191 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2025-02-08 09:07:03,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:07:03,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 09:07:03,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:03,194 INFO L225 Difference]: With dead ends: 66 [2025-02-08 09:07:03,194 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 09:07:03,194 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-02-08 09:07:03,194 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 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-02-08 09:07:03,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:07:03,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 09:07:03,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2025-02-08 09:07:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 56 states have internal predecessors, (76), 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-02-08 09:07:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2025-02-08 09:07:03,200 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 14 [2025-02-08 09:07:03,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:03,200 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2025-02-08 09:07:03,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:07:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2025-02-08 09:07:03,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 09:07:03,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:03,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:03,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:07:03,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:07:03,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1019397592, now seen corresponding path program 1 times [2025-02-08 09:07:03,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:03,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957290003] [2025-02-08 09:07:03,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:03,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:03,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 09:07:03,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 09:07:03,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:03,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:03,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:03,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957290003] [2025-02-08 09:07:03,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957290003] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:07:03,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425909213] [2025-02-08 09:07:03,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:03,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:07:03,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:07:03,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:07:03,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 09:07:03,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 09:07:03,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 09:07:03,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:03,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:03,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:07:03,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:07:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:03,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:07:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:03,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425909213] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:07:03,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:07:03,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 09:07:03,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591918073] [2025-02-08 09:07:03,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:07:03,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 09:07:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:03,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 09:07:03,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:07:03,434 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-02-08 09:07:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:03,465 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2025-02-08 09:07:03,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 09:07:03,468 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-08 09:07:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:03,469 INFO L225 Difference]: With dead ends: 133 [2025-02-08 09:07:03,469 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 09:07:03,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:07:03,470 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:03,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:07:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 09:07:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-08 09:07:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.353846153846154) internal successors, (88), 68 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-02-08 09:07:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2025-02-08 09:07:03,481 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 18 [2025-02-08 09:07:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:03,481 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2025-02-08 09:07:03,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-02-08 09:07:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2025-02-08 09:07:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 09:07:03,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:03,483 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:03,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 09:07:03,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:07:03,685 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-02-08 09:07:03,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:03,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1153821016, now seen corresponding path program 2 times [2025-02-08 09:07:03,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:03,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690428101] [2025-02-08 09:07:03,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:07:03,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:03,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 09:07:03,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 24 statements. [2025-02-08 09:07:03,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 09:07:03,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:07:03,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:03,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690428101] [2025-02-08 09:07:03,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690428101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:07:03,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:07:03,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:07:03,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835655707] [2025-02-08 09:07:03,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:07:03,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:07:03,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:03,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:07:03,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:07:03,781 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:07:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:03,853 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2025-02-08 09:07:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:07:03,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-08 09:07:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:03,854 INFO L225 Difference]: With dead ends: 95 [2025-02-08 09:07:03,854 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 09:07:03,854 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-02-08 09:07:03,856 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:03,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 109 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:07:03,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 09:07:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2025-02-08 09:07:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 80 states have internal predecessors, (106), 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-02-08 09:07:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2025-02-08 09:07:03,866 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 24 [2025-02-08 09:07:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:03,866 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2025-02-08 09:07:03,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:07:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2025-02-08 09:07:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 09:07:03,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:03,866 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-02-08 09:07:03,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 09:07:03,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:07:03,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1408713106, now seen corresponding path program 1 times [2025-02-08 09:07:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:03,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801446048] [2025-02-08 09:07:03,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:03,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 09:07:03,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 09:07:03,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:03,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:03,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:03,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801446048] [2025-02-08 09:07:03,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801446048] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:07:03,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178561596] [2025-02-08 09:07:03,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:03,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:07:03,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:07:03,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:07:03,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 09:07:04,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 09:07:04,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 09:07:04,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:04,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:04,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 09:07:04,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:07:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:04,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:07:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:04,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178561596] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:07:04,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:07:04,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-08 09:07:04,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185789401] [2025-02-08 09:07:04,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:07:04,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 09:07:04,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:04,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 09:07:04,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-08 09:07:04,176 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:07:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:04,215 INFO L93 Difference]: Finished difference Result 193 states and 253 transitions. [2025-02-08 09:07:04,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 09:07:04,215 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-08 09:07:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:04,216 INFO L225 Difference]: With dead ends: 193 [2025-02-08 09:07:04,216 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 09:07:04,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-08 09:07:04,217 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:04,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:07:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 09:07:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-02-08 09:07:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 104 states have internal predecessors, (130), 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-02-08 09:07:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2025-02-08 09:07:04,229 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 25 [2025-02-08 09:07:04,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:04,229 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2025-02-08 09:07:04,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:07:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2025-02-08 09:07:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 09:07:04,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:04,230 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:04,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 09:07:04,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:07:04,436 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-02-08 09:07:04,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:04,436 INFO L85 PathProgramCache]: Analyzing trace with hash 580893330, now seen corresponding path program 2 times [2025-02-08 09:07:04,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:04,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048965750] [2025-02-08 09:07:04,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:07:04,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:04,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-08 09:07:04,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 37 statements. [2025-02-08 09:07:04,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 09:07:04,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-08 09:07:04,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:04,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048965750] [2025-02-08 09:07:04,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048965750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:07:04,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:07:04,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 09:07:04,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911214735] [2025-02-08 09:07:04,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:07:04,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:07:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:04,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:07:04,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:07:04,575 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-02-08 09:07:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:04,638 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2025-02-08 09:07:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:07:04,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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 37 [2025-02-08 09:07:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:04,639 INFO L225 Difference]: With dead ends: 118 [2025-02-08 09:07:04,639 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 09:07:04,640 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-02-08 09:07:04,640 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:04,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 110 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:07:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 09:07:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2025-02-08 09:07:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 103 states have (on average 1.2815533980582525) internal successors, (132), 106 states have internal predecessors, (132), 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-02-08 09:07:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2025-02-08 09:07:04,645 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 37 [2025-02-08 09:07:04,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:04,645 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2025-02-08 09:07:04,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-02-08 09:07:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2025-02-08 09:07:04,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 09:07:04,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:04,646 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:04,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 09:07:04,647 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-02-08 09:07:04,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:04,647 INFO L85 PathProgramCache]: Analyzing trace with hash 827791252, now seen corresponding path program 1 times [2025-02-08 09:07:04,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:04,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445502417] [2025-02-08 09:07:04,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:04,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:04,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 09:07:04,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 09:07:04,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:04,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445502417] [2025-02-08 09:07:04,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445502417] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:07:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702536044] [2025-02-08 09:07:04,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:04,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:07:04,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:07:04,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:07:04,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 09:07:05,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 09:07:05,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 09:07:05,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:05,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:05,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 09:07:05,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:07:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:05,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:07:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:07:05,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702536044] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:07:05,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:07:05,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-02-08 09:07:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599272660] [2025-02-08 09:07:05,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:07:05,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 09:07:05,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:05,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 09:07:05,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 09:07:05,438 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:07:05,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:05,513 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2025-02-08 09:07:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-08 09:07:05,515 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-08 09:07:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:05,517 INFO L225 Difference]: With dead ends: 269 [2025-02-08 09:07:05,517 INFO L226 Difference]: Without dead ends: 159 [2025-02-08 09:07:05,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 09:07:05,521 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:05,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:07:05,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-08 09:07:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-08 09:07:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 151 states have (on average 1.1920529801324504) internal successors, (180), 154 states have internal predecessors, (180), 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-02-08 09:07:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2025-02-08 09:07:05,528 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 38 [2025-02-08 09:07:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:05,529 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2025-02-08 09:07:05,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:07:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2025-02-08 09:07:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 09:07:05,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:05,530 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:05,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 09:07:05,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 09:07:05,731 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-02-08 09:07:05,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:05,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2124211604, now seen corresponding path program 2 times [2025-02-08 09:07:05,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:05,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273313433] [2025-02-08 09:07:05,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:07:05,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:05,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-08 09:07:05,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 62 statements. [2025-02-08 09:07:05,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 09:07:05,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-02-08 09:07:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273313433] [2025-02-08 09:07:05,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273313433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:07:05,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:07:05,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 09:07:05,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580078049] [2025-02-08 09:07:05,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:07:05,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:07:05,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:05,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:07:05,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:07:05,894 INFO L87 Difference]: Start difference. First operand 159 states and 184 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-02-08 09:07:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:05,995 INFO L93 Difference]: Finished difference Result 171 states and 200 transitions. [2025-02-08 09:07:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:07:05,995 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 62 [2025-02-08 09:07:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:05,996 INFO L225 Difference]: With dead ends: 171 [2025-02-08 09:07:05,996 INFO L226 Difference]: Without dead ends: 169 [2025-02-08 09:07:05,996 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-02-08 09:07:05,997 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:05,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 127 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:07:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-08 09:07:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2025-02-08 09:07:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 159 states have (on average 1.1949685534591195) internal successors, (190), 162 states have internal predecessors, (190), 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-02-08 09:07:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2025-02-08 09:07:06,009 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 62 [2025-02-08 09:07:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:06,009 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2025-02-08 09:07:06,009 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-02-08 09:07:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2025-02-08 09:07:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 09:07:06,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:06,014 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:06,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 09:07:06,014 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:07:06,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:06,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1914131447, now seen corresponding path program 1 times [2025-02-08 09:07:06,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:06,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094095062] [2025-02-08 09:07:06,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:06,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 09:07:06,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 09:07:06,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:06,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:07:06,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:07:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094095062] [2025-02-08 09:07:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094095062] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:07:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380428953] [2025-02-08 09:07:06,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:07:06,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:07:06,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:07:06,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:07:06,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 09:07:06,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 09:07:06,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 09:07:06,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:06,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:07:06,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 09:07:06,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:07:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:07:07,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:07:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 09:07:07,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380428953] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:07:07,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:07:07,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2025-02-08 09:07:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122123619] [2025-02-08 09:07:07,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:07:07,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-08 09:07:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:07:07,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-08 09:07:07,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2025-02-08 09:07:07,652 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 43 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 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-02-08 09:07:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:07:07,740 INFO L93 Difference]: Finished difference Result 363 states and 429 transitions. [2025-02-08 09:07:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-08 09:07:07,741 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 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 67 [2025-02-08 09:07:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:07:07,742 INFO L225 Difference]: With dead ends: 363 [2025-02-08 09:07:07,742 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 09:07:07,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 101 SyntacticMatches, 23 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2025-02-08 09:07:07,744 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:07:07,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:07:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 09:07:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-02-08 09:07:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 189 states have (on average 1.164021164021164) internal successors, (220), 192 states have internal predecessors, (220), 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-02-08 09:07:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2025-02-08 09:07:07,755 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 67 [2025-02-08 09:07:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:07:07,755 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2025-02-08 09:07:07,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 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-02-08 09:07:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2025-02-08 09:07:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-08 09:07:07,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:07:07,756 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:07:07,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 09:07:07,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 09:07:07,961 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 09:07:07,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:07:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1989927595, now seen corresponding path program 2 times [2025-02-08 09:07:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:07:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950792371] [2025-02-08 09:07:07,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:07:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:07:07,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-02-08 09:07:08,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 09:07:08,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:07:08,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 09:07:08,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 09:07:08,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 09:07:08,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 09:07:08,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:07:08,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 09:07:08,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 09:07:08,182 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 09:07:08,182 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-08 09:07:08,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-08 09:07:08,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 09:07:08,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 09:07:08,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 09:07:08,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-08 09:07:08,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 09:07:08,187 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 09:07:08,236 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 09:07:08,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:07:08 BoogieIcfgContainer [2025-02-08 09:07:08,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 09:07:08,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 09:07:08,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 09:07:08,240 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 09:07:08,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:07:01" (3/4) ... [2025-02-08 09:07:08,241 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 09:07:08,300 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 31. [2025-02-08 09:07:08,359 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 09:07:08,359 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 09:07:08,359 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 09:07:08,361 INFO L158 Benchmark]: Toolchain (without parser) took 7164.54ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 115.5MB in the beginning and 159.7MB in the end (delta: -44.2MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2025-02-08 09:07:08,361 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:07:08,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.37ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 97.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:07:08,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.45ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:07:08,361 INFO L158 Benchmark]: Boogie Preprocessor took 32.05ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 93.2MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:07:08,362 INFO L158 Benchmark]: IcfgBuilder took 382.28ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 71.2MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:07:08,362 INFO L158 Benchmark]: TraceAbstraction took 6309.61ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 70.8MB in the beginning and 168.1MB in the end (delta: -97.3MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2025-02-08 09:07:08,362 INFO L158 Benchmark]: Witness Printer took 118.90ms. Allocated memory is still 226.5MB. Free memory was 168.1MB in the beginning and 159.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:07:08,363 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.37ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 97.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.45ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.05ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 93.2MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 382.28ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 71.2MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6309.61ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 70.8MB in the beginning and 168.1MB in the end (delta: -97.3MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. * Witness Printer took 118.90ms. Allocated memory is still 226.5MB. Free memory was 168.1MB in the beginning and 159.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 564]: integer overflow possible integer overflow possible We found a FailurePath: [L597] struct node_t *list = ((void *)0); [L597] struct node_t *list = ((void *)0); [L598] int dataNotFinished = 0; VAL [list={3:0}] [L602] COND TRUE dataNotFinished || __VERIFIER_nondet_int() [L600] CALL append(&list) [L587] struct node_t *node = malloc(sizeof *node); [L588] EXPR \read(**pointerToList) [L588] node->next = *pointerToList [L589] EXPR \read(**pointerToList) [L589] COND TRUE *pointerToList == ((void *)0) [L590] CALL create_data(((void *)0)) VAL [\old(prevData)={0:0}] [L552] prevData != ((void *)0) && prevData->hasNextPartReference VAL [\old(prevData)={0:0}, prevData={0:0}] [L552] prevData != ((void *)0) && prevData->hasNextPartReference VAL [\old(prevData)={0:0}, prevData={0:0}] [L552] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L555] Data data = malloc(sizeof *data); [L556] data->array = (int*) malloc(20 * sizeof(data->array)) [L557] int counter = 0; [L558] counter = 0 VAL [\old(prevData)={0:0}, counter=0, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=1, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=2, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=3, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=4, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=5, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=6, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=7, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=8, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=9, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=10, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=11, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=12, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=13, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=14, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=15, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=16, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=17, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=18, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=19, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=20, data={-3:0}, prevData={0:0}] [L558] COND FALSE !(counter < 20) [L561] data->number = 0 [L562] int userInput = __VERIFIER_nondet_int(); [L563] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L564] EXPR data->number [L564] EXPR data->number + __VERIFIER_nondet_int() [L564] data->number = data->number + __VERIFIER_nondet_int() [L565] userInput = __VERIFIER_nondet_int() [L563] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L564] EXPR data->number [L564] data->number + __VERIFIER_nondet_int() VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}] - UnprovableResult [Line: 570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 2405 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1918 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 487 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 393 GetRequests, 250 SyntacticMatches, 23 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=11, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 561 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 1374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1434 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 435/1676 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 09:07:08,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)