./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02-1.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_test02-1.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 28a553c15880be5addf3df873556de4819c52401c3a5fad59e6112c02b491d19 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:04:12,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:04:12,711 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,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:04:12,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:04:12,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:04:12,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:04:12,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:04:12,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:04:12,740 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:04:12,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:04:12,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:04:12,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:04:12,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:04:12,741 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:04:12,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:04:12,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:04:12,742 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:04:12,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:04:12,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:04:12,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:04:12,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:04:12,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:04:12,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:04:12,742 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:04:12,743 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:04:12,743 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:04:12,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:04:12,743 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:04:12,743 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:04:12,743 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:04:12,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:04:12,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:04:12,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:04:12,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:04:12,744 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:04:12,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:04:12,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:04:12,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:04:12,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:04:12,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:04:12,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:04:12,744 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:04:12,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:04:12,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:04:12,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:04:12,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:04:12,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:04:12,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:04:12,745 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 -> 28a553c15880be5addf3df873556de4819c52401c3a5fad59e6112c02b491d19 [2025-04-29 11:04:12,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:04:12,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:04:12,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:04:12,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:04:12,986 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:04:12,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02-1.c [2025-04-29 11:04:14,219 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7cc74b4/8662f40e9e0e48f29d02d7eda5baeff7/FLAG2ec06e10e [2025-04-29 11:04:14,453 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:04:14,454 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02-1.c [2025-04-29 11:04:14,455 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,455 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,463 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7cc74b4/8662f40e9e0e48f29d02d7eda5baeff7/FLAG2ec06e10e [2025-04-29 11:04:15,268 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7cc74b4/8662f40e9e0e48f29d02d7eda5baeff7 [2025-04-29 11:04:15,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:04:15,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:04:15,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:04:15,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:04:15,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:04:15,276 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,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5f95c 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,278 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,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:04:15,453 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:04:15,461 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:04:15,503 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:04:15,515 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:04:15,515 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,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:04:15,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:04:15,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:04:15,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:04:15,523 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,530 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,547 INFO L138 Inliner]: procedures = 17, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2025-04-29 11:04:15,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:04:15,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:04:15,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:04:15,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:04:15,555 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,556 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,561 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,587 INFO L175 MemorySlicer]: Split 42 memory accesses to 2 slices as follows [31, 11]. 74 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 18 writes are split as follows [16, 2]. [2025-04-29 11:04:15,587 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,587 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,597 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,598 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,604 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,605 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,610 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,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:04:15,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:04:15,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:04:15,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:04:15,618 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,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:04:15,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:15,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:04:15,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:04:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:04:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-04-29 11:04:15,668 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:04:15,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:04:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:04:15,735 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:04:15,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:04:15,974 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-04-29 11:04:15,976 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:04:15,986 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:04:15,987 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-29 11:04:15,987 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,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:04:15,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:04:15,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:04:15,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:04:15,992 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,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b42535 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,993 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,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b42535 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,993 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,994 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-1.c [2025-04-29 11:04:16,003 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:04:16,004 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test02-1.c that has 2 procedures, 51 locations, 69 edges, 1 initial locations, 5 loop locations, and 6 error locations. [2025-04-29 11:04:16,042 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:04:16,053 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;@14ade499, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:04:16,054 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:04:16,057 INFO L278 IsEmpty]: Start isEmpty. Operand has 51 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 47 states have internal predecessors, (63), 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,063 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:04:16,063 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:16,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:16,064 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,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1832307416, now seen corresponding path program 1 times [2025-04-29 11:04:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:16,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040465174] [2025-04-29 11:04:16,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:16,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:04:16,194 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,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:16,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:16,368 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,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:16,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040465174] [2025-04-29 11:04:16,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040465174] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:16,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:16,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:16,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055041052] [2025-04-29 11:04:16,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:16,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:04:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:16,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:04:16,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:04:16,388 INFO L87 Difference]: Start difference. First operand has 51 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 47 states have internal predecessors, (63), 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,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:16,430 INFO L93 Difference]: Finished difference Result 103 states and 140 transitions. [2025-04-29 11:04:16,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:04:16,432 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,433 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:16,436 INFO L225 Difference]: With dead ends: 103 [2025-04-29 11:04:16,436 INFO L226 Difference]: Without dead ends: 46 [2025-04-29 11:04:16,439 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,444 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 176 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,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 176 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,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-29 11:04:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-04-29 11:04:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 42 states have internal predecessors, (53), 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,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2025-04-29 11:04:16,472 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 10 [2025-04-29 11:04:16,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:16,473 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2025-04-29 11:04:16,473 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,473 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2025-04-29 11:04:16,474 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:04:16,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:16,475 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:16,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:04:16,475 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,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1530817654, now seen corresponding path program 1 times [2025-04-29 11:04:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:16,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518704777] [2025-04-29 11:04:16,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:16,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:16,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:04:16,529 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,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:16,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:16,664 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,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:16,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518704777] [2025-04-29 11:04:16,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518704777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:16,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:16,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:04:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905662753] [2025-04-29 11:04:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:16,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:04:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:16,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:04:16,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:04:16,667 INFO L87 Difference]: Start difference. First operand 46 states and 57 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,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:16,717 INFO L93 Difference]: Finished difference Result 123 states and 154 transitions. [2025-04-29 11:04:16,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:04:16,718 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,718 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:16,719 INFO L225 Difference]: With dead ends: 123 [2025-04-29 11:04:16,719 INFO L226 Difference]: Without dead ends: 79 [2025-04-29 11:04:16,719 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,720 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 150 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,720 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 150 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,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-29 11:04:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2025-04-29 11:04:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 68 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:04:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2025-04-29 11:04:16,728 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 13 [2025-04-29 11:04:16,728 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:16,728 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2025-04-29 11:04:16,728 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,728 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2025-04-29 11:04:16,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:04:16,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:16,729 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:16,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:04:16,729 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,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash 244189708, now seen corresponding path program 1 times [2025-04-29 11:04:16,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:16,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678521549] [2025-04-29 11:04:16,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:16,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:16,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:04:16,750 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,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:16,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:16,852 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,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:16,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678521549] [2025-04-29 11:04:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678521549] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:16,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540326514] [2025-04-29 11:04:16,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:16,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:16,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:16,856 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,857 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,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:04:16,939 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,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:16,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:16,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:04:16,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:16,986 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,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:04:16,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540326514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:16,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:04:16,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:04:16,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587785648] [2025-04-29 11:04:16,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:16,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:04:16,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:16,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:04:16,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:04:16,988 INFO L87 Difference]: Start difference. First operand 73 states and 94 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:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:17,020 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2025-04-29 11:04:17,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:04:17,021 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:17,022 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:17,022 INFO L225 Difference]: With dead ends: 73 [2025-04-29 11:04:17,023 INFO L226 Difference]: Without dead ends: 72 [2025-04-29 11:04:17,024 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,024 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:04:17,024 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 238 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:04:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-29 11:04:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-04-29 11:04:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 67 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:04:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2025-04-29 11:04:17,034 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 13 [2025-04-29 11:04:17,034 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:17,034 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2025-04-29 11:04:17,034 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,035 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2025-04-29 11:04:17,035 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:04:17,035 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:17,035 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:17,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:04:17,235 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,236 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,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1020053596, now seen corresponding path program 1 times [2025-04-29 11:04:17,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:17,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661995294] [2025-04-29 11:04:17,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:17,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:04:17,256 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,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:17,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:17,296 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,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:17,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661995294] [2025-04-29 11:04:17,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661995294] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:17,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:17,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:04:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145906509] [2025-04-29 11:04:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:17,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:04:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:17,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:04:17,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:04:17,298 INFO L87 Difference]: Start difference. First operand 72 states and 92 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,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:17,306 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2025-04-29 11:04:17,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:04:17,309 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,309 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:17,309 INFO L225 Difference]: With dead ends: 72 [2025-04-29 11:04:17,309 INFO L226 Difference]: Without dead ends: 71 [2025-04-29 11:04:17,309 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,310 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 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,310 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 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,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-29 11:04:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-04-29 11:04:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 62 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:04:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2025-04-29 11:04:17,318 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 14 [2025-04-29 11:04:17,318 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:17,318 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2025-04-29 11:04:17,318 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,318 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2025-04-29 11:04:17,318 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:04:17,318 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:17,318 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,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:04:17,319 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,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:17,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1616917818, now seen corresponding path program 1 times [2025-04-29 11:04:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:17,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418569033] [2025-04-29 11:04:17,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:17,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:17,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:04:17,355 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,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:17,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:17,409 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,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:17,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418569033] [2025-04-29 11:04:17,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418569033] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:17,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844140936] [2025-04-29 11:04:17,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:17,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:17,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:17,412 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,414 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,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:04:17,495 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,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:17,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:17,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:04:17,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:17,519 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,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:04:17,555 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,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844140936] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:04:17,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:04:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-29 11:04:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070021881] [2025-04-29 11:04:17,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:04:17,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:04:17,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:17,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:04:17,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:04:17,558 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:17,588 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2025-04-29 11:04:17,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:04:17,591 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:04:17,591 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:17,591 INFO L225 Difference]: With dead ends: 144 [2025-04-29 11:04:17,591 INFO L226 Difference]: Without dead ends: 79 [2025-04-29 11:04:17,592 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:04:17,592 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:04:17,592 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:04:17,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-29 11:04:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-04-29 11:04:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.323943661971831) internal successors, (94), 74 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:04:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2025-04-29 11:04:17,600 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 19 [2025-04-29 11:04:17,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:17,600 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2025-04-29 11:04:17,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:17,601 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2025-04-29 11:04:17,601 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:04:17,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:17,601 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,608 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,801 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,802 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,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:17,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2015267078, now seen corresponding path program 2 times [2025-04-29 11:04:17,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:17,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417093775] [2025-04-29 11:04:17,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:04:17,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:17,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-29 11:04:17,819 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,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:04:17,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:17,901 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,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:17,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417093775] [2025-04-29 11:04:17,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417093775] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:17,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:17,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:17,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122598373] [2025-04-29 11:04:17,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:17,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:04:17,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:17,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:04:17,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:04:17,902 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:17,972 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2025-04-29 11:04:17,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:04:17,972 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,972 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:17,974 INFO L225 Difference]: With dead ends: 111 [2025-04-29 11:04:17,974 INFO L226 Difference]: Without dead ends: 110 [2025-04-29 11:04:17,974 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,974 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:04:17,974 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:04:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-29 11:04:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2025-04-29 11:04:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 88 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:04:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2025-04-29 11:04:17,985 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 25 [2025-04-29 11:04:17,985 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:17,985 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2025-04-29 11:04:17,985 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,985 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2025-04-29 11:04:17,986 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:04:17,986 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:17,986 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,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:04:17,986 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,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1951230100, now seen corresponding path program 1 times [2025-04-29 11:04:17,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:17,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492001753] [2025-04-29 11:04:17,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:17,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:04:18,032 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,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:18,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:18,177 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:18,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:18,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492001753] [2025-04-29 11:04:18,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492001753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:18,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:18,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:04:18,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374733192] [2025-04-29 11:04:18,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:18,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:04:18,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:18,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:04:18,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:04:18,178 INFO L87 Difference]: Start difference. First operand 93 states and 118 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,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:18,245 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2025-04-29 11:04:18,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:04:18,245 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 26 [2025-04-29 11:04:18,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:18,246 INFO L225 Difference]: With dead ends: 110 [2025-04-29 11:04:18,246 INFO L226 Difference]: Without dead ends: 109 [2025-04-29 11:04:18,246 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,246 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:04:18,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:04:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-29 11:04:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2025-04-29 11:04:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 90 states have internal predecessors, (116), 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,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 120 transitions. [2025-04-29 11:04:18,258 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 120 transitions. Word has length 26 [2025-04-29 11:04:18,258 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:18,258 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 120 transitions. [2025-04-29 11:04:18,258 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,258 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 120 transitions. [2025-04-29 11:04:18,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:04:18,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:18,259 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:18,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:04:18,259 INFO L403 AbstractCegarLoop]: === Iteration 8 === 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,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1703624323, now seen corresponding path program 1 times [2025-04-29 11:04:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:18,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582209308] [2025-04-29 11:04:18,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:18,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:18,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:04:18,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:04:18,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:18,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:18,652 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:18,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:18,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582209308] [2025-04-29 11:04:18,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582209308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:18,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:18,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:04:18,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903433322] [2025-04-29 11:04:18,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:18,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:04:18,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:18,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:04:18,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:04:18,655 INFO L87 Difference]: Start difference. First operand 95 states and 120 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:18,774 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2025-04-29 11:04:18,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:04:18,775 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:04:18,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:18,777 INFO L225 Difference]: With dead ends: 133 [2025-04-29 11:04:18,777 INFO L226 Difference]: Without dead ends: 131 [2025-04-29 11:04:18,777 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:04:18,777 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 33 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:04:18,777 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 157 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:04:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-29 11:04:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2025-04-29 11:04:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 102 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:04:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 134 transitions. [2025-04-29 11:04:18,791 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 134 transitions. Word has length 28 [2025-04-29 11:04:18,791 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:18,791 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 134 transitions. [2025-04-29 11:04:18,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:04:18,792 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2025-04-29 11:04:18,792 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:04:18,792 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:04:18,792 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:18,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:04:18,792 INFO L403 AbstractCegarLoop]: === Iteration 9 === 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:18,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:18,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1597373042, now seen corresponding path program 1 times [2025-04-29 11:04:18,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:18,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061728785] [2025-04-29 11:04:18,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:18,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:18,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:04:18,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:04:18,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:18,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:04:18,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:04:18,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:04:18,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:04:18,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:18,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:04:18,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:04:18,858 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:04:18,859 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-04-29 11:04:18,860 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-04-29 11:04:18,860 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-04-29 11:04:18,860 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-04-29 11:04:18,860 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-04-29 11:04:18,860 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-04-29 11:04:18,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:04:18,863 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:18,901 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:04:18,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:04:18 BoogieIcfgContainer [2025-04-29 11:04:18,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:04:18,905 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:04:18,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:04:18,905 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:04:18,906 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:18,906 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:04:18,943 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 11. [2025-04-29 11:04:18,979 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:04:18,979 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:04:18,979 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:04:18,980 INFO L158 Benchmark]: Toolchain (without parser) took 3708.47ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 69.9MB in the end (delta: 42.8MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2025-04-29 11:04:18,980 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:04:18,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.59ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 97.5MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:04:18,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.86ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:04:18,980 INFO L158 Benchmark]: Boogie Preprocessor took 69.42ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 92.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:04:18,980 INFO L158 Benchmark]: RCFGBuilder took 369.80ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 71.5MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-29 11:04:18,980 INFO L158 Benchmark]: TraceAbstraction took 2915.23ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 75.0MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:04:18,981 INFO L158 Benchmark]: Witness Printer took 74.32ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 69.9MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:04:18,982 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.59ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 97.5MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.86ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.42ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 92.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 369.80ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 71.5MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2915.23ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 75.0MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 74.32ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 69.9MB in the end (delta: 5.1MB). There was no memory consumed. 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: [L96] struct node_t *list = NULL; [L96] struct node_t *list = NULL; [L105] int dataNotFinished = 0; VAL [list={2:0}] [L108] CALL append(&list) [L83] struct node_t *node = malloc(sizeof *node); [L84] EXPR \read(**pointerToList) [L84] node->next = *pointerToList [L86] EXPR \read(**pointerToList) [L86] COND TRUE *pointerToList == NULL [L87] 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={-4:0}, prevData={0:0}] [L42] COND TRUE counter < 3 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=1, data={-4:0}, prevData={0:0}] [L42] COND TRUE counter < 3 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=2, data={-4:0}, prevData={0:0}] [L42] COND TRUE counter < 3 [L43] EXPR data->array [L43] data->array[counter] = __VERIFIER_nondet_int() [L42] counter++ VAL [\at(prevData, Pre)={0:0}, counter=3, data={-4:0}, prevData={0:0}] [L42] COND FALSE !(counter < 3) [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={-4: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={-4:0}, prevData={0:0}, userInput=0] [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\at(prevData, Pre)={0:0}, data={-4: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={-4: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={-4: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={-4:0}, prevData={0:0}, userInput=0] [L49] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\at(prevData, Pre)={0:0}, data={-4: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={-4: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={-4: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: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: 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, 51 locations, 69 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 1269 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 872 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 397 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=8, InterpolantAutomatonStates: 38, 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, 8 MinimizatonAttempts, 65 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 213 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 43/48 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:18,997 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)