./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-2.c -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 a684ae88ed5990d1f56cc2e7642722a0f0e29e3475f7a3777b300a3fe8afa6c1 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:04:12,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:04:12,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:04:12,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:04:12,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:04:12,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:04:12,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:04:12,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:04:12,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:04:12,724 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:04:12,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:04:12,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:04:12,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:04:12,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:04:12,725 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:04:12,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:04:12,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:04:12,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:04:12,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:04:12,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:04:12,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:04:12,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:04:12,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:04:12,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:04:12,726 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:04:12,726 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:04:12,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:04:12,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:04:12,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:04:12,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:04:12,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:04:12,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:04:12,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:04:12,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:04:12,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:04:12,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:04:12,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:04:12,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:04:12,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:04:12,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:04:12,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:04:12,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:04:12,728 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:04:12,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:04:12,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:04:12,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:04:12,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:04:12,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:04:12,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:04:12,729 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 -> a684ae88ed5990d1f56cc2e7642722a0f0e29e3475f7a3777b300a3fe8afa6c1 [2025-04-29 11:04:12,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:04:12,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:04:12,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:04:12,959 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:04:12,959 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:04:12,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-2.c [2025-04-29 11:04:14,193 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f2e576e/1235a20d3ea2484fa72db156afe0c615/FLAG7ba4969e6 [2025-04-29 11:04:14,354 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:04:14,354 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-2.c [2025-04-29 11:04:14,356 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:04:14,356 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:04:14,360 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f2e576e/1235a20d3ea2484fa72db156afe0c615/FLAG7ba4969e6 [2025-04-29 11:04:15,244 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f2e576e/1235a20d3ea2484fa72db156afe0c615 [2025-04-29 11:04:15,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:04:15,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:04:15,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:04:15,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:04:15,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:04:15,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bffcec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15, skipping insertion in model container [2025-04-29 11:04:15,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:04:15,397 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:04:15,404 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:04:15,428 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:04:15,443 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:04:15,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15 WrapperNode [2025-04-29 11:04:15,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:04:15,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:04:15,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:04:15,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:04:15,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,468 INFO L138 Inliner]: procedures = 17, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2025-04-29 11:04:15,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:04:15,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:04:15,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:04:15,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:04:15,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,497 INFO L175 MemorySlicer]: Split 42 memory accesses to 2 slices as follows [11, 31]. 74 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 18 writes are split as follows [2, 16]. [2025-04-29 11:04:15,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:04:15,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:04:15,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:04:15,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:04:15,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (1/1) ... [2025-04-29 11:04:15,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:04:15,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:15,555 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-04-29 11:04:15,561 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-04-29 11:04:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:04:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:04:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-04-29 11:04:15,576 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-04-29 11:04:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:04:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:04:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:04:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:04:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:04:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:04:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:04:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:04:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:04:15,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:04:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:04:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:04:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:04:15,663 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:04:15,665 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:04:15,942 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-04-29 11:04:15,945 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:04:15,951 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:04:15,955 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-29 11:04:15,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:04:15 BoogieIcfgContainer [2025-04-29 11:04:15,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:04:15,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:04:15,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:04:15,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:04:15,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:04:15" (1/3) ... [2025-04-29 11:04:15,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a9ab33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:04:15, skipping insertion in model container [2025-04-29 11:04:15,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:15" (2/3) ... [2025-04-29 11:04:15,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a9ab33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:04:15, skipping insertion in model container [2025-04-29 11:04:15,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:04:15" (3/3) ... [2025-04-29 11:04:15,962 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.c [2025-04-29 11:04:15,972 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:04:15,973 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test01-2.c that has 2 procedures, 49 locations, 66 edges, 1 initial locations, 4 loop locations, and 6 error locations. [2025-04-29 11:04:16,015 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:04:16,022 INFO L340 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;@64b0d7a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:04:16,023 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:04:16,025 INFO L278 IsEmpty]: Start isEmpty. Operand has 49 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 45 states have internal predecessors, (60), 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-04-29 11:04:16,031 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:04:16,031 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:16,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:16,032 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:04:16,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:16,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1517825584, now seen corresponding path program 1 times [2025-04-29 11:04:16,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:16,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752000508] [2025-04-29 11:04:16,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:16,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:16,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:04:16,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:04:16,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:16,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:16,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:16,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752000508] [2025-04-29 11:04:16,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752000508] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:16,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:16,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:16,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211360878] [2025-04-29 11:04:16,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:16,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:04:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:16,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:04:16,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:04:16,332 INFO L87 Difference]: Start difference. First operand has 49 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 45 states have internal predecessors, (60), 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.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:16,378 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2025-04-29 11:04:16,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:04:16,380 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:04:16,380 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:16,384 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:04:16,384 INFO L226 Difference]: Without dead ends: 44 [2025-04-29 11:04:16,388 INFO L436 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-04-29 11:04:16,390 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 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-04-29 11:04:16,393 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:04:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-29 11:04:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-29 11:04:16,413 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-04-29 11:04:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-04-29 11:04:16,422 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 10 [2025-04-29 11:04:16,423 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:16,423 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-04-29 11:04:16,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:16,423 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-04-29 11:04:16,425 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:04:16,425 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:16,425 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:16,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:04:16,426 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:04:16,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:16,427 INFO L85 PathProgramCache]: Analyzing trace with hash 126328194, now seen corresponding path program 1 times [2025-04-29 11:04:16,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:16,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430667027] [2025-04-29 11:04:16,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:16,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:16,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:04:16,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:04:16,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:16,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:04:16,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:16,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430667027] [2025-04-29 11:04:16,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430667027] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:16,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:16,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:04:16,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353504533] [2025-04-29 11:04:16,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:16,628 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:04:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:16,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:04:16,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:04:16,630 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:16,674 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2025-04-29 11:04:16,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:04:16,674 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:04:16,674 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:16,676 INFO L225 Difference]: With dead ends: 117 [2025-04-29 11:04:16,676 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 11:04:16,677 INFO L436 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-04-29 11:04:16,678 INFO L437 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-04-29 11:04:16,679 INFO L438 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-04-29 11:04:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 11:04:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2025-04-29 11:04:16,686 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-04-29 11:04:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-04-29 11:04:16,689 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 13 [2025-04-29 11:04:16,689 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:16,689 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-04-29 11:04:16,690 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:16,690 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-04-29 11:04:16,690 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:04:16,690 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:16,690 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:16,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:04:16,691 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:04:16,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1901335556, now seen corresponding path program 1 times [2025-04-29 11:04:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:16,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91498703] [2025-04-29 11:04:16,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:16,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:16,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:04:16,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:04:16,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:16,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:16,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:16,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91498703] [2025-04-29 11:04:16,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91498703] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:16,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976025210] [2025-04-29 11:04:16,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:16,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:16,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:16,801 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-04-29 11:04:16,802 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-04-29 11:04:16,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:04:16,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:04:16,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:16,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:16,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:04:16,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:16,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:04:16,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976025210] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:16,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:04:16,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:04:16,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50467829] [2025-04-29 11:04:16,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:16,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:04:16,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:16,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:04:16,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:04:16,959 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:16,997 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2025-04-29 11:04:16,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:04:16,999 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:04:16,999 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:17,000 INFO L225 Difference]: With dead ends: 69 [2025-04-29 11:04:17,000 INFO L226 Difference]: Without dead ends: 68 [2025-04-29 11:04:17,000 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:04:17,000 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:04:17,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:04:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-29 11:04:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-04-29 11:04:17,008 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-04-29 11:04:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2025-04-29 11:04:17,010 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 13 [2025-04-29 11:04:17,011 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:17,011 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2025-04-29 11:04:17,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:17,011 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2025-04-29 11:04:17,011 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:04:17,011 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:17,011 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:17,019 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-04-29 11:04:17,216 WARN L466 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-04-29 11:04:17,216 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:04:17,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:17,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1188139860, now seen corresponding path program 1 times [2025-04-29 11:04:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:17,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122137707] [2025-04-29 11:04:17,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:17,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:17,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:04:17,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:04:17,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:17,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:04:17,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:17,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122137707] [2025-04-29 11:04:17,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122137707] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:17,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:17,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:04:17,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383320762] [2025-04-29 11:04:17,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:17,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:04:17,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:17,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:04:17,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:04:17,264 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:17,271 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2025-04-29 11:04:17,271 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:04:17,272 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:04:17,272 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:17,272 INFO L225 Difference]: With dead ends: 68 [2025-04-29 11:04:17,272 INFO L226 Difference]: Without dead ends: 67 [2025-04-29 11:04:17,272 INFO L436 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-04-29 11:04:17,273 INFO L437 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-04-29 11:04:17,273 INFO L438 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-04-29 11:04:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-29 11:04:17,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-04-29 11:04:17,277 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-04-29 11:04:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-04-29 11:04:17,277 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 14 [2025-04-29 11:04:17,277 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:17,278 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-04-29 11:04:17,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:17,278 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2025-04-29 11:04:17,278 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:04:17,278 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:17,278 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-04-29 11:04:17,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:04:17,279 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:04:17,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:17,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1841620274, now seen corresponding path program 1 times [2025-04-29 11:04:17,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:17,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285913708] [2025-04-29 11:04:17,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:17,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:17,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:04:17,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:04:17,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:17,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:17,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:17,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285913708] [2025-04-29 11:04:17,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285913708] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:17,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907431679] [2025-04-29 11:04:17,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:17,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:17,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:17,387 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-04-29 11:04:17,389 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-04-29 11:04:17,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:04:17,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:04:17,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:17,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:17,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:04:17,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:17,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:04:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:17,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907431679] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:04:17,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:04:17,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:04:17,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905732863] [2025-04-29 11:04:17,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:04:17,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:04:17,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:17,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:04:17,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:04:17,531 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-04-29 11:04:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:17,565 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2025-04-29 11:04:17,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:04:17,565 INFO L79 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-04-29 11:04:17,565 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:17,566 INFO L225 Difference]: With dead ends: 136 [2025-04-29 11:04:17,567 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 11:04:17,567 INFO L436 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-04-29 11:04:17,568 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:04:17,568 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:04:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 11:04:17,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-04-29 11:04:17,573 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-04-29 11:04:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2025-04-29 11:04:17,573 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 19 [2025-04-29 11:04:17,573 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:17,573 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2025-04-29 11:04:17,573 INFO L486 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-04-29 11:04:17,573 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2025-04-29 11:04:17,574 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:04:17,574 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:17,574 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-04-29 11:04:17,580 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-04-29 11:04:17,774 WARN L466 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-04-29 11:04:17,774 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:04:17,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:17,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1680847630, now seen corresponding path program 2 times [2025-04-29 11:04:17,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:17,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454465848] [2025-04-29 11:04:17,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:04:17,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:17,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-29 11:04:17,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 25 statements. [2025-04-29 11:04:17,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:04:17,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:04:17,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:17,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454465848] [2025-04-29 11:04:17,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454465848] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:17,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:17,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:17,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088876022] [2025-04-29 11:04:17,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:17,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:04:17,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:17,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:04:17,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:04:17,885 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-04-29 11:04:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:17,963 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2025-04-29 11:04:17,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:04:17,964 INFO L79 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-04-29 11:04:17,964 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:17,964 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:04:17,966 INFO L226 Difference]: Without dead ends: 98 [2025-04-29 11:04:17,966 INFO L436 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-04-29 11:04:17,967 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-04-29 11:04:17,967 INFO L438 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-04-29 11:04:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-29 11:04:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2025-04-29 11:04:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 84 states have internal predecessors, (110), 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-04-29 11:04:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2025-04-29 11:04:17,976 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 25 [2025-04-29 11:04:17,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:17,976 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2025-04-29 11:04:17,976 INFO L486 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-04-29 11:04:17,976 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2025-04-29 11:04:17,976 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:04:17,976 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:17,976 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-04-29 11:04:17,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:04:17,977 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:04:17,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash -566668900, now seen corresponding path program 1 times [2025-04-29 11:04:17,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:17,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620447393] [2025-04-29 11:04:17,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:17,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:17,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:04:17,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:04:17,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:17,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:18,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:18,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620447393] [2025-04-29 11:04:18,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620447393] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:18,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608087807] [2025-04-29 11:04:18,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:18,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:18,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:18,130 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-04-29 11:04:18,132 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-04-29 11:04:18,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:04:18,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:04:18,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:18,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:18,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:04:18,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:18,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:04:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:18,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608087807] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:04:18,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:04:18,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:04:18,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240360988] [2025-04-29 11:04:18,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:04:18,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:04:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:18,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:04:18,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:04:18,374 INFO L87 Difference]: Start difference. First operand 89 states and 114 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-04-29 11:04:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:18,419 INFO L93 Difference]: Finished difference Result 200 states and 260 transitions. [2025-04-29 11:04:18,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:04:18,419 INFO L79 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-04-29 11:04:18,420 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:18,420 INFO L225 Difference]: With dead ends: 200 [2025-04-29 11:04:18,420 INFO L226 Difference]: Without dead ends: 113 [2025-04-29 11:04:18,421 INFO L436 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-04-29 11:04:18,421 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:04:18,422 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:04:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-29 11:04:18,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-04-29 11:04:18,428 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-04-29 11:04:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2025-04-29 11:04:18,429 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 26 [2025-04-29 11:04:18,429 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:18,429 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2025-04-29 11:04:18,429 INFO L486 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-04-29 11:04:18,429 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2025-04-29 11:04:18,430 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:04:18,430 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:18,430 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-04-29 11:04:18,436 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-04-29 11:04:18,634 WARN L466 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-04-29 11:04:18,634 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:04:18,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1040769564, now seen corresponding path program 2 times [2025-04-29 11:04:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:18,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673897797] [2025-04-29 11:04:18,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:04:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:18,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 11:04:18,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 38 statements. [2025-04-29 11:04:18,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:04:18,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-04-29 11:04:18,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:18,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673897797] [2025-04-29 11:04:18,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673897797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:18,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:18,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:04:18,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117291993] [2025-04-29 11:04:18,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:18,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:04:18,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:18,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:04:18,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:04:18,779 INFO L87 Difference]: Start difference. First operand 113 states and 138 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-04-29 11:04:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:18,847 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2025-04-29 11:04:18,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:04:18,847 INFO L79 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-04-29 11:04:18,847 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:18,848 INFO L225 Difference]: With dead ends: 122 [2025-04-29 11:04:18,848 INFO L226 Difference]: Without dead ends: 121 [2025-04-29 11:04:18,848 INFO L436 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-04-29 11:04:18,849 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 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-04-29 11:04:18,849 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:04:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-04-29 11:04:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2025-04-29 11:04:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 107 states have (on average 1.2710280373831775) internal successors, (136), 110 states have internal predecessors, (136), 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-04-29 11:04:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2025-04-29 11:04:18,856 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 38 [2025-04-29 11:04:18,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:18,856 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2025-04-29 11:04:18,856 INFO L486 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-04-29 11:04:18,856 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2025-04-29 11:04:18,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:04:18,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:18,857 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-04-29 11:04:18,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:04:18,857 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:04:18,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:18,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1040837122, now seen corresponding path program 1 times [2025-04-29 11:04:18,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:18,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268464227] [2025-04-29 11:04:18,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:18,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:04:18,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:04:18,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:18,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:19,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:19,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268464227] [2025-04-29 11:04:19,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268464227] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:19,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865525307] [2025-04-29 11:04:19,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:19,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:19,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:19,181 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-04-29 11:04:19,182 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-04-29 11:04:19,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:04:19,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:04:19,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:19,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:19,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:04:19,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:19,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:04:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:19,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865525307] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:04:19,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:04:19,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-04-29 11:04:19,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120977287] [2025-04-29 11:04:19,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:04:19,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 11:04:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:19,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 11:04:19,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-04-29 11:04:19,632 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:19,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:19,700 INFO L93 Difference]: Finished difference Result 276 states and 344 transitions. [2025-04-29 11:04:19,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-29 11:04:19,701 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-29 11:04:19,701 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:19,701 INFO L225 Difference]: With dead ends: 276 [2025-04-29 11:04:19,701 INFO L226 Difference]: Without dead ends: 163 [2025-04-29 11:04:19,702 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-04-29 11:04:19,703 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:04:19,703 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:04:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-04-29 11:04:19,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-04-29 11:04:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 155 states have (on average 1.1870967741935483) internal successors, (184), 158 states have internal predecessors, (184), 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-04-29 11:04:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2025-04-29 11:04:19,711 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 38 [2025-04-29 11:04:19,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:19,712 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2025-04-29 11:04:19,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:19,712 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2025-04-29 11:04:19,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-29 11:04:19,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:19,713 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:19,719 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-04-29 11:04:19,913 WARN L466 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-04-29 11:04:19,914 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:04:19,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:19,915 INFO L85 PathProgramCache]: Analyzing trace with hash 986368770, now seen corresponding path program 2 times [2025-04-29 11:04:19,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:19,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006576963] [2025-04-29 11:04:19,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:04:19,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:19,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-04-29 11:04:19,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 62 statements. [2025-04-29 11:04:19,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:04:19,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-04-29 11:04:20,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:20,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006576963] [2025-04-29 11:04:20,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006576963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:20,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:20,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:04:20,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774553228] [2025-04-29 11:04:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:20,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:04:20,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:20,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:04:20,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:04:20,076 INFO L87 Difference]: Start difference. First operand 163 states and 188 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-04-29 11:04:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:20,151 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2025-04-29 11:04:20,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:04:20,151 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-04-29 11:04:20,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:20,152 INFO L225 Difference]: With dead ends: 175 [2025-04-29 11:04:20,153 INFO L226 Difference]: Without dead ends: 173 [2025-04-29 11:04:20,154 INFO L436 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-04-29 11:04:20,154 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 37 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 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-04-29 11:04:20,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 115 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:04:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-04-29 11:04:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2025-04-29 11:04:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 163 states have (on average 1.1901840490797546) internal successors, (194), 166 states have internal predecessors, (194), 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-04-29 11:04:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2025-04-29 11:04:20,169 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 62 [2025-04-29 11:04:20,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:20,169 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2025-04-29 11:04:20,169 INFO L486 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-04-29 11:04:20,169 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2025-04-29 11:04:20,171 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-29 11:04:20,171 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:20,171 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:20,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:04:20,171 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:04:20,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:20,171 INFO L85 PathProgramCache]: Analyzing trace with hash 808731142, now seen corresponding path program 1 times [2025-04-29 11:04:20,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:20,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914350555] [2025-04-29 11:04:20,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:20,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 11:04:20,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 11:04:20,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:20,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:04:20,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:20,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914350555] [2025-04-29 11:04:20,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914350555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:20,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237847121] [2025-04-29 11:04:20,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:20,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:20,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:20,874 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-04-29 11:04:20,875 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-04-29 11:04:20,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 11:04:21,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 11:04:21,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:21,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:21,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 11:04:21,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:04:21,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:04:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:04:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237847121] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:04:21,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:04:21,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2025-04-29 11:04:21,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546940728] [2025-04-29 11:04:21,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:04:21,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-29 11:04:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:21,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-29 11:04:21,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2025-04-29 11:04:21,585 INFO L87 Difference]: Start difference. First operand 171 states and 198 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-04-29 11:04:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:21,668 INFO L93 Difference]: Finished difference Result 370 states and 436 transitions. [2025-04-29 11:04:21,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-29 11:04:21,669 INFO L79 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 69 [2025-04-29 11:04:21,669 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:21,670 INFO L225 Difference]: With dead ends: 370 [2025-04-29 11:04:21,670 INFO L226 Difference]: Without dead ends: 201 [2025-04-29 11:04:21,671 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 105 SyntacticMatches, 23 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2025-04-29 11:04:21,672 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:04:21,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:04:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-04-29 11:04:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-04-29 11:04:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 193 states have (on average 1.160621761658031) internal successors, (224), 196 states have internal predecessors, (224), 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-04-29 11:04:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 228 transitions. [2025-04-29 11:04:21,679 INFO L79 Accepts]: Start accepts. Automaton has 201 states and 228 transitions. Word has length 69 [2025-04-29 11:04:21,679 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:21,679 INFO L485 AbstractCegarLoop]: Abstraction has 201 states and 228 transitions. [2025-04-29 11:04:21,679 INFO L486 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-04-29 11:04:21,679 INFO L278 IsEmpty]: Start isEmpty. Operand 201 states and 228 transitions. [2025-04-29 11:04:21,681 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-04-29 11:04:21,681 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:21,681 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:21,687 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-04-29 11:04:21,881 WARN L466 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-04-29 11:04:21,881 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:04:21,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:21,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1301368752, now seen corresponding path program 2 times [2025-04-29 11:04:21,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:21,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222907551] [2025-04-29 11:04:21,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:04:21,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:21,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-04-29 11:04:21,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-04-29 11:04:21,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:04:21,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:04:21,961 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:04:21,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-29 11:04:22,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-29 11:04:22,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:22,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:04:22,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:04:22,050 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:04:22,051 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-04-29 11:04:22,052 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-04-29 11:04:22,052 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-04-29 11:04:22,052 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-04-29 11:04:22,052 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-04-29 11:04:22,052 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-04-29 11:04:22,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:04:22,054 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1] [2025-04-29 11:04:22,112 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:04:22,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:04:22 BoogieIcfgContainer [2025-04-29 11:04:22,116 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:04:22,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:04:22,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:04:22,117 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:04:22,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:04:15" (3/4) ... [2025-04-29 11:04:22,118 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:04:22,176 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 28. [2025-04-29 11:04:22,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:04:22,224 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:04:22,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:04:22,224 INFO L158 Benchmark]: Toolchain (without parser) took 6977.01ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 111.9MB in the beginning and 211.0MB in the end (delta: -99.1MB). Peak memory consumption was 180.1MB. Max. memory is 16.1GB. [2025-04-29 11:04:22,225 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:04:22,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.50ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 96.9MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:04:22,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.72ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:04:22,225 INFO L158 Benchmark]: Boogie Preprocessor took 56.41ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 92.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:04:22,225 INFO L158 Benchmark]: RCFGBuilder took 429.15ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 71.8MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-29 11:04:22,225 INFO L158 Benchmark]: TraceAbstraction took 6159.06ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 71.4MB in the beginning and 219.4MB in the end (delta: -148.0MB). Peak memory consumption was 129.7MB. Max. memory is 16.1GB. [2025-04-29 11:04:22,226 INFO L158 Benchmark]: Witness Printer took 107.17ms. Allocated memory is still 427.8MB. Free memory was 219.4MB in the beginning and 211.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:04:22,227 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.41ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.50ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 96.9MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.72ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.41ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 92.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 429.15ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 71.8MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6159.06ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 71.4MB in the beginning and 219.4MB in the end (delta: -148.0MB). Peak memory consumption was 129.7MB. Max. memory is 16.1GB. * Witness Printer took 107.17ms. Allocated memory is still 427.8MB. Free memory was 219.4MB in the beginning and 211.0MB 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: 50]: integer overflow possible integer overflow possible We found a FailurePath: [L93] struct node_t *list = NULL; [L93] struct node_t *list = NULL; [L103] int dataNotFinished = 0; VAL [list={2:0}] [L106] CALL append(&list) [L80] struct node_t *node = malloc(sizeof *node); [L81] EXPR \read(**pointerToList) [L81] node->next = *pointerToList [L83] EXPR \read(**pointerToList) [L83] COND TRUE *pointerToList == NULL [L84] CALL create_data(NULL) VAL [\at(prevData, Pre)={0:0}] [L33] prevData != NULL && prevData->hasNextPartReference VAL [\at(prevData, Pre)={0:0}, prevData={0:0}] [L33] prevData != NULL && prevData->hasNextPartReference VAL [\at(prevData, Pre)={0:0}, prevData={0:0}] [L33] COND FALSE !(prevData != NULL && prevData->hasNextPartReference) [L37] Data data = malloc(sizeof *data); [L39] data->array = (int*) malloc(20 * sizeof(data->array)) [L41] int counter = 0; [L42] counter = 0 VAL [\at(prevData, Pre)={0:0}, counter=0, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=1, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=2, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=3, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=4, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=5, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=6, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=7, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=8, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=9, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=10, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=11, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=12, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=13, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=14, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=15, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=16, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=17, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=18, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=19, data={-3:0}, prevData={0:0}] [L42] COND TRUE counter < 20 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=20, data={-3:0}, prevData={0:0}] [L42] COND FALSE !(counter < 20) [L46] data->number = 0 [L47] int userInput = __VERIFIER_nondet_int(); [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\at(prevData, Pre)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 [L49] EXPR data->number [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\at(prevData, Pre)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\at(prevData, Pre)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L49] EXPR data->number [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\at(prevData, Pre)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L49] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L50] EXPR data->number [L50] EXPR data->number + __VERIFIER_nondet_int() [L50] data->number = data->number + __VERIFIER_nondet_int() [L51] userInput = __VERIFIER_nondet_int() [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\at(prevData, Pre)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 [L49] EXPR data->number [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\at(prevData, Pre)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\at(prevData, Pre)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L49] EXPR data->number [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\at(prevData, Pre)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L49] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L50] EXPR data->number [L50] data->number + __VERIFIER_nondet_int() VAL [\at(prevData, Pre)={0:0}, data={-3:0}, prevData={0:0}] - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: 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, 49 locations, 66 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 2178 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1667 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 511 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 258 SyntacticMatches, 23 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred 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.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 576 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 624 ConstructedInterpolants, 0 QuantifiedInterpolants, 1403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1374 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 440/1681 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-04-29 11:04:22,244 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)