./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:52:17,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:52:17,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:52:17,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:52:17,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:52:17,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:52:17,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:52:17,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:52:17,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:52:17,230 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:52:17,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:52:17,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:52:17,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:52:17,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:52:17,230 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:52:17,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:52:17,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:52:17,231 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:52:17,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:52:17,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:52:17,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:52:17,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:52:17,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:52:17,231 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:52:17,231 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:52:17,231 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:52:17,231 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:52:17,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:52:17,231 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:52:17,232 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:52:17,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:52:17,232 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2025-03-09 01:52:17,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:52:17,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:52:17,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:52:17,476 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:52:17,476 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:52:17,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2025-03-09 01:52:18,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2288f72/eae7411cbe7244e0a619c6635763a0e9/FLAG7554f15e7 [2025-03-09 01:52:18,859 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:52:18,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2025-03-09 01:52:18,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2288f72/eae7411cbe7244e0a619c6635763a0e9/FLAG7554f15e7 [2025-03-09 01:52:19,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2288f72/eae7411cbe7244e0a619c6635763a0e9 [2025-03-09 01:52:19,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:52:19,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:52:19,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:52:19,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:52:19,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:52:19,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51cb165f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19, skipping insertion in model container [2025-03-09 01:52:19,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:52:19,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:52:19,421 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:52:19,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:52:19,490 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:52:19,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19 WrapperNode [2025-03-09 01:52:19,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:52:19,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:52:19,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:52:19,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:52:19,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,522 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2025-03-09 01:52:19,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:52:19,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:52:19,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:52:19,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:52:19,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,548 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 11, 31]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 2, 16]. [2025-03-09 01:52:19,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:52:19,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:52:19,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:52:19,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:52:19,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (1/1) ... [2025-03-09 01:52:19,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:52:19,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:19,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:52:19,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:52:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:52:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:52:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:52:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:52:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:52:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:52:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:52:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-03-09 01:52:19,605 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-03-09 01:52:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:52:19,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:52:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:52:19,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:52:19,701 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:52:19,702 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:52:19,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc #t~mem5.base, #t~mem5.offset; [2025-03-09 01:52:19,928 INFO L1307 $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-03-09 01:52:19,950 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-09 01:52:19,950 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:52:19,958 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:52:19,959 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:52:19,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:52:19 BoogieIcfgContainer [2025-03-09 01:52:19,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:52:19,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:52:19,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:52:19,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:52:19,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:52:19" (1/3) ... [2025-03-09 01:52:19,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4d02a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:52:19, skipping insertion in model container [2025-03-09 01:52:19,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:52:19" (2/3) ... [2025-03-09 01:52:19,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4d02a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:52:19, skipping insertion in model container [2025-03-09 01:52:19,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:52:19" (3/3) ... [2025-03-09 01:52:19,968 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i [2025-03-09 01:52:19,978 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:52:19,980 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test01-2.i that has 2 procedures, 48 locations, 1 initial locations, 4 loop locations, and 6 error locations. [2025-03-09 01:52:20,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:52:20,026 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;@19306643, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:52:20,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:52:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 44 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:52:20,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:20,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:20,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:52:20,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash 701201282, now seen corresponding path program 1 times [2025-03-09 01:52:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:20,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56425840] [2025-03-09 01:52:20,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:20,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:20,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:52:20,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:52:20,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:20,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:20,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:20,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56425840] [2025-03-09 01:52:20,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56425840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:20,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:20,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:52:20,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227562610] [2025-03-09 01:52:20,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:20,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:52:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:20,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:52:20,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:20,353 INFO L87 Difference]: Start difference. First operand has 48 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 44 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:20,392 INFO L93 Difference]: Finished difference Result 97 states and 132 transitions. [2025-03-09 01:52:20,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:52:20,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 01:52:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:20,397 INFO L225 Difference]: With dead ends: 97 [2025-03-09 01:52:20,397 INFO L226 Difference]: Without dead ends: 44 [2025-03-09 01:52:20,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:20,401 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:20,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 167 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-09 01:52:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-09 01:52:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.457142857142857) internal successors, (51), 40 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-03-09 01:52:20,424 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 11 [2025-03-09 01:52:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:20,424 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-03-09 01:52:20,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-03-09 01:52:20,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:52:20,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:20,425 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:20,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:52:20,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:52:20,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1233541514, now seen corresponding path program 1 times [2025-03-09 01:52:20,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:20,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654700984] [2025-03-09 01:52:20,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:20,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:20,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:52:20,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:52:20,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:20,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:52:20,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:20,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654700984] [2025-03-09 01:52:20,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654700984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:20,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:20,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:52:20,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445139897] [2025-03-09 01:52:20,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:20,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:52:20,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:20,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:52:20,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:20,571 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:20,610 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2025-03-09 01:52:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:52:20,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 01:52:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:20,612 INFO L225 Difference]: With dead ends: 117 [2025-03-09 01:52:20,612 INFO L226 Difference]: Without dead ends: 75 [2025-03-09 01:52:20,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:52:20,614 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 32 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:20,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 144 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-09 01:52:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2025-03-09 01:52:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 64 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-03-09 01:52:20,627 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 14 [2025-03-09 01:52:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:20,627 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-03-09 01:52:20,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-03-09 01:52:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:52:20,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:20,628 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:20,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:52:20,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:52:20,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash 509268821, now seen corresponding path program 1 times [2025-03-09 01:52:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:20,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138131735] [2025-03-09 01:52:20,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:20,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:52:20,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:52:20,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:20,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:20,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:20,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138131735] [2025-03-09 01:52:20,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138131735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:52:20,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631681570] [2025-03-09 01:52:20,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:20,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:20,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:20,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:52:20,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:52:20,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:52:20,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:52:20,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:20,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:20,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:52:20,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:52:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:20,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:52:20,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631681570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:20,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:52:20,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:52:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183033973] [2025-03-09 01:52:20,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:20,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:52:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:20,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:52:20,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:52:20,946 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:20,978 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2025-03-09 01:52:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:52:20,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 01:52:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:20,982 INFO L225 Difference]: With dead ends: 69 [2025-03-09 01:52:20,982 INFO L226 Difference]: Without dead ends: 68 [2025-03-09 01:52:20,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:52:20,983 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:20,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 137 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:20,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-09 01:52:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-09 01:52:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.423728813559322) internal successors, (84), 63 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-03-09 01:52:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2025-03-09 01:52:20,991 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 14 [2025-03-09 01:52:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:20,991 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2025-03-09 01:52:20,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2025-03-09 01:52:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:52:20,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:20,992 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:21,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:52:21,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:21,196 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-03-09 01:52:21,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:21,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1392535739, now seen corresponding path program 1 times [2025-03-09 01:52:21,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:21,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796097080] [2025-03-09 01:52:21,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:21,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:21,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:52:21,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:52:21,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:21,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:52:21,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:21,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796097080] [2025-03-09 01:52:21,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796097080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:21,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:21,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:52:21,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356043322] [2025-03-09 01:52:21,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:21,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:52:21,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:21,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:52:21,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:52:21,257 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:21,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:21,266 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2025-03-09 01:52:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:52:21,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 01:52:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:21,267 INFO L225 Difference]: With dead ends: 68 [2025-03-09 01:52:21,268 INFO L226 Difference]: Without dead ends: 67 [2025-03-09 01:52:21,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:52:21,269 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:21,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-09 01:52:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-03-09 01:52:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 58 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-03-09 01:52:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-03-09 01:52:21,276 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 15 [2025-03-09 01:52:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:21,276 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-03-09 01:52:21,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2025-03-09 01:52:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 01:52:21,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:21,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:21,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:52:21,277 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-03-09 01:52:21,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1473571065, now seen corresponding path program 1 times [2025-03-09 01:52:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363968282] [2025-03-09 01:52:21,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:21,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:52:21,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:52:21,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:21,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:21,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363968282] [2025-03-09 01:52:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363968282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:52:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657612252] [2025-03-09 01:52:21,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:21,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:21,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:21,368 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:52:21,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:52:21,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:52:21,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:52:21,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:21,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:21,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:52:21,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:52:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:21,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:52:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:21,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657612252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:52:21,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:52:21,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:52:21,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895204112] [2025-03-09 01:52:21,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:52:21,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:52:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:21,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:52:21,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:52:21,522 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:21,554 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2025-03-09 01:52:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:52:21,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-09 01:52:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:21,556 INFO L225 Difference]: With dead ends: 136 [2025-03-09 01:52:21,556 INFO L226 Difference]: Without dead ends: 75 [2025-03-09 01:52:21,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 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-03-09 01:52:21,557 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:21,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:21,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-09 01:52:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-09 01:52:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 70 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2025-03-09 01:52:21,565 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 19 [2025-03-09 01:52:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:21,565 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2025-03-09 01:52:21,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2025-03-09 01:52:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 01:52:21,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:21,567 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:21,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:52:21,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:21,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:52:21,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1776324679, now seen corresponding path program 2 times [2025-03-09 01:52:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:21,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368138362] [2025-03-09 01:52:21,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:52:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:21,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-09 01:52:21,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 25 statements. [2025-03-09 01:52:21,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:52:21,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:52:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368138362] [2025-03-09 01:52:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368138362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:21,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:52:21,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254391231] [2025-03-09 01:52:21,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:21,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:52:21,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:21,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:52:21,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:52:21,900 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:21,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:21,969 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2025-03-09 01:52:21,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:52:21,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-09 01:52:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:21,970 INFO L225 Difference]: With dead ends: 97 [2025-03-09 01:52:21,970 INFO L226 Difference]: Without dead ends: 96 [2025-03-09 01:52:21,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:52:21,971 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 115 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:21,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:52:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-09 01:52:21,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2025-03-09 01:52:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 82 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2025-03-09 01:52:21,977 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 25 [2025-03-09 01:52:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:21,977 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2025-03-09 01:52:21,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2025-03-09 01:52:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 01:52:21,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:21,978 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:52:21,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:52:21,978 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-03-09 01:52:21,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:21,979 INFO L85 PathProgramCache]: Analyzing trace with hash 768509777, now seen corresponding path program 1 times [2025-03-09 01:52:21,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:21,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958542433] [2025-03-09 01:52:21,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:21,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:21,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:52:21,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:52:21,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:21,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:22,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958542433] [2025-03-09 01:52:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958542433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:52:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168019626] [2025-03-09 01:52:22,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:22,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:22,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:22,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:52:22,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:52:22,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:52:22,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:52:22,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:22,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:22,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:52:22,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:52:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:22,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:52:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:22,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168019626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:52:22,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:52:22,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-09 01:52:22,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201123261] [2025-03-09 01:52:22,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:52:22,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:52:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:22,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:52:22,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:52:22,345 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:22,392 INFO L93 Difference]: Finished difference Result 196 states and 256 transitions. [2025-03-09 01:52:22,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:52:22,394 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-09 01:52:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:22,394 INFO L225 Difference]: With dead ends: 196 [2025-03-09 01:52:22,394 INFO L226 Difference]: Without dead ends: 111 [2025-03-09 01:52:22,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 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-03-09 01:52:22,395 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:22,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:52:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-09 01:52:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-09 01:52:22,406 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-03-09 01:52:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2025-03-09 01:52:22,407 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 26 [2025-03-09 01:52:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:22,407 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2025-03-09 01:52:22,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2025-03-09 01:52:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 01:52:22,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:22,408 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-03-09 01:52:22,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:52:22,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:22,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:52:22,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:22,609 INFO L85 PathProgramCache]: Analyzing trace with hash 913922513, now seen corresponding path program 2 times [2025-03-09 01:52:22,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:22,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693528172] [2025-03-09 01:52:22,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:52:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:22,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:52:22,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 38 statements. [2025-03-09 01:52:22,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:52:22,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-09 01:52:22,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:22,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693528172] [2025-03-09 01:52:22,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693528172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:22,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:22,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:52:22,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326844161] [2025-03-09 01:52:22,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:22,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:52:22,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:22,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:52:22,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:52:22,742 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:22,817 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2025-03-09 01:52:22,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:52:22,817 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 38 [2025-03-09 01:52:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:22,819 INFO L225 Difference]: With dead ends: 120 [2025-03-09 01:52:22,819 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 01:52:22,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:52:22,820 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 116 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-03-09 01:52:22,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:52:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 01:52:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2025-03-09 01:52:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 105 states have (on average 1.276190476190476) internal successors, (134), 108 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2025-03-09 01:52:22,840 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 38 [2025-03-09 01:52:22,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:22,840 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2025-03-09 01:52:22,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:22,840 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2025-03-09 01:52:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-09 01:52:22,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:22,841 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, 1] [2025-03-09 01:52:22,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:52:22,841 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:52:22,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:22,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1733205963, now seen corresponding path program 1 times [2025-03-09 01:52:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:22,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835769868] [2025-03-09 01:52:22,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:22,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:22,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:52:22,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:52:22,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:22,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:23,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:23,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835769868] [2025-03-09 01:52:23,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835769868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:52:23,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332335040] [2025-03-09 01:52:23,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:23,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:23,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:23,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:52:23,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:52:23,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:52:23,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:52:23,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:23,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:23,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:52:23,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:52:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:23,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:52:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:52:23,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332335040] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:52:23,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:52:23,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-09 01:52:23,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974341707] [2025-03-09 01:52:23,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:52:23,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 01:52:23,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:23,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 01:52:23,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 01:52:23,598 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:23,670 INFO L93 Difference]: Finished difference Result 272 states and 340 transitions. [2025-03-09 01:52:23,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-09 01:52:23,672 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-09 01:52:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:23,672 INFO L225 Difference]: With dead ends: 272 [2025-03-09 01:52:23,673 INFO L226 Difference]: Without dead ends: 161 [2025-03-09 01:52:23,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 61 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-03-09 01:52:23,674 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:23,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 507 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:52:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-09 01:52:23,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-03-09 01:52:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 156 states have internal predecessors, (182), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2025-03-09 01:52:23,685 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 39 [2025-03-09 01:52:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:23,686 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2025-03-09 01:52:23,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2025-03-09 01:52:23,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 01:52:23,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:23,687 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, 1] [2025-03-09 01:52:23,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:52:23,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:23,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:52:23,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1342203083, now seen corresponding path program 2 times [2025-03-09 01:52:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:23,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157574794] [2025-03-09 01:52:23,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:52:23,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:23,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-09 01:52:23,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 63 statements. [2025-03-09 01:52:23,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:52:23,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-09 01:52:24,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:24,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157574794] [2025-03-09 01:52:24,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157574794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:52:24,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:52:24,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:52:24,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596066903] [2025-03-09 01:52:24,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:52:24,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:52:24,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:24,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:52:24,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:52:24,019 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:24,105 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2025-03-09 01:52:24,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:52:24,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 63 [2025-03-09 01:52:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:24,108 INFO L225 Difference]: With dead ends: 173 [2025-03-09 01:52:24,108 INFO L226 Difference]: Without dead ends: 171 [2025-03-09 01:52:24,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:52:24,108 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 34 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:24,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 115 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:52:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-09 01:52:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2025-03-09 01:52:24,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 161 states have (on average 1.1925465838509317) internal successors, (192), 164 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2025-03-09 01:52:24,121 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 63 [2025-03-09 01:52:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:24,121 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2025-03-09 01:52:24,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2025-03-09 01:52:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 01:52:24,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:24,123 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, 1] [2025-03-09 01:52:24,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:52:24,123 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-03-09 01:52:24,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash -643083512, now seen corresponding path program 1 times [2025-03-09 01:52:24,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:24,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317972761] [2025-03-09 01:52:24,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:24,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:24,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 01:52:24,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 01:52:24,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:24,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:52:24,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:52:24,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317972761] [2025-03-09 01:52:24,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317972761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:52:24,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200083089] [2025-03-09 01:52:24,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:52:24,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:52:24,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:52:24,879 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:52:24,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:52:24,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 01:52:25,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 01:52:25,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:25,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:52:25,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 01:52:25,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:52:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:52:25,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:52:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:52:25,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200083089] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:52:25,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:52:25,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2025-03-09 01:52:25,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736228836] [2025-03-09 01:52:25,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:52:25,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-09 01:52:25,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:52:25,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-09 01:52:25,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 01:52:25,662 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:52:25,753 INFO L93 Difference]: Finished difference Result 366 states and 432 transitions. [2025-03-09 01:52:25,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-09 01:52:25,754 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 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 68 [2025-03-09 01:52:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:52:25,755 INFO L225 Difference]: With dead ends: 366 [2025-03-09 01:52:25,755 INFO L226 Difference]: Without dead ends: 199 [2025-03-09 01:52:25,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 103 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-03-09 01:52:25,756 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:52:25,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:52:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-09 01:52:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-09 01:52:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 191 states have (on average 1.162303664921466) internal successors, (222), 194 states have internal predecessors, (222), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:52:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 226 transitions. [2025-03-09 01:52:25,768 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 226 transitions. Word has length 68 [2025-03-09 01:52:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:52:25,768 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 226 transitions. [2025-03-09 01:52:25,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:52:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 226 transitions. [2025-03-09 01:52:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-09 01:52:25,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:52:25,770 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, 1] [2025-03-09 01:52:25,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:52:25,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 01:52:25,971 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-03-09 01:52:25,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:52:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1200404598, now seen corresponding path program 2 times [2025-03-09 01:52:25,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:52:25,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285596161] [2025-03-09 01:52:25,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:52:25,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:52:26,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-09 01:52:26,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 01:52:26,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:52:26,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:52:26,074 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:52:26,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-09 01:52:26,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 01:52:26,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:52:26,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:52:26,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:52:26,177 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:52:26,177 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-09 01:52:26,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 01:52:26,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 01:52:26,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 01:52:26,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 01:52:26,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-09 01:52:26,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:52:26,181 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:52:26,222 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:52:26,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:52:26 BoogieIcfgContainer [2025-03-09 01:52:26,226 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:52:26,226 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:52:26,226 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:52:26,226 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:52:26,227 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:52:19" (3/4) ... [2025-03-09 01:52:26,227 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-09 01:52:26,276 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 31. [2025-03-09 01:52:26,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:52:26,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:52:26,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:52:26,325 INFO L158 Benchmark]: Toolchain (without parser) took 7147.78ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 154.0MB in the beginning and 182.9MB in the end (delta: -28.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2025-03-09 01:52:26,325 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:52:26,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.16ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 135.8MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:52:26,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.33ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 134.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:52:26,325 INFO L158 Benchmark]: Boogie Preprocessor took 39.33ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 131.5MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:52:26,326 INFO L158 Benchmark]: IcfgBuilder took 395.45ms. Allocated memory is still 201.3MB. Free memory was 131.5MB in the beginning and 109.3MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:52:26,326 INFO L158 Benchmark]: TraceAbstraction took 6263.96ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 108.5MB in the beginning and 191.3MB in the end (delta: -82.7MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2025-03-09 01:52:26,326 INFO L158 Benchmark]: Witness Printer took 97.95ms. Allocated memory is still 243.3MB. Free memory was 191.3MB in the beginning and 182.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:52:26,327 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.18ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.16ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 135.8MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.33ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 134.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.33ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 131.5MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 395.45ms. Allocated memory is still 201.3MB. Free memory was 131.5MB in the beginning and 109.3MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6263.96ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 108.5MB in the beginning and 191.3MB in the end (delta: -82.7MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. * Witness Printer took 97.95ms. Allocated memory is still 243.3MB. Free memory was 191.3MB in the beginning and 182.9MB 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, 48 locations, 65 edges, 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, 91 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 2228 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1718 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 510 mSDtfsCounter, 348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 259 SyntacticMatches, 23 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred 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, 581 NumberOfCodeBlocks, 506 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 630 ConstructedInterpolants, 0 QuantifiedInterpolants, 1397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1434 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 437/1678 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-03-09 01:52:26,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 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)