./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ifeqn4f.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/ifeqn4f.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7849780e572f4b715fd4a0599e2552ba9e578b3aff0bf5f111ebb8575b54953d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:39:19,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:39:19,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:39:19,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:39:19,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:39:20,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:39:20,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:39:20,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:39:20,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:39:20,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:39:20,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:39:20,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:39:20,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:39:20,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:39:20,011 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:39:20,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:39:20,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:39:20,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:39:20,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:39:20,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:39:20,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:39:20,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:39:20,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:39:20,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:39:20,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:39:20,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:39:20,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:39:20,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:39:20,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:39:20,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:39:20,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:39:20,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:39:20,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:39:20,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:39:20,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:39:20,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:39:20,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:39:20,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:39:20,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:39:20,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:39:20,014 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:39:20,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:39:20,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:39:20,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:39:20,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:39:20,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:39:20,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:39:20,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:39:20,015 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 7849780e572f4b715fd4a0599e2552ba9e578b3aff0bf5f111ebb8575b54953d [2025-01-08 22:39:20,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:39:20,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:39:20,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:39:20,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:39:20,279 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:39:20,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ifeqn4f.c [2025-01-08 22:39:21,548 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de5e71025/ac60cf590514431881780eeadc6e88a4/FLAG52fe723ca [2025-01-08 22:39:21,799 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:39:21,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn4f.c [2025-01-08 22:39:21,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de5e71025/ac60cf590514431881780eeadc6e88a4/FLAG52fe723ca [2025-01-08 22:39:21,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de5e71025/ac60cf590514431881780eeadc6e88a4 [2025-01-08 22:39:21,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:39:21,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:39:21,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:39:21,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:39:21,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:39:21,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:39:21" (1/1) ... [2025-01-08 22:39:21,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470e317e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:21, skipping insertion in model container [2025-01-08 22:39:21,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:39:21" (1/1) ... [2025-01-08 22:39:21,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:39:21,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn4f.c[590,603] [2025-01-08 22:39:21,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:39:22,007 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:39:22,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn4f.c[590,603] [2025-01-08 22:39:22,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:39:22,035 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:39:22,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22 WrapperNode [2025-01-08 22:39:22,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:39:22,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:39:22,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:39:22,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:39:22,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,065 INFO L138 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-01-08 22:39:22,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:39:22,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:39:22,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:39:22,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:39:22,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,092 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-01-08 22:39:22,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:39:22,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:39:22,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:39:22,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:39:22,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (1/1) ... [2025-01-08 22:39:22,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:39:22,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:39:22,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:39:22,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:39:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:39:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:39:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:39:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:39:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:39:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:39:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:39:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-08 22:39:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:39:22,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:39:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:39:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:39:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:39:22,245 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:39:22,248 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:39:22,402 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-08 22:39:22,402 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:39:22,409 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:39:22,410 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:39:22,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:39:22 BoogieIcfgContainer [2025-01-08 22:39:22,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:39:22,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:39:22,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:39:22,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:39:22,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:39:21" (1/3) ... [2025-01-08 22:39:22,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6799c3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:39:22, skipping insertion in model container [2025-01-08 22:39:22,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:39:22" (2/3) ... [2025-01-08 22:39:22,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6799c3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:39:22, skipping insertion in model container [2025-01-08 22:39:22,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:39:22" (3/3) ... [2025-01-08 22:39:22,418 INFO L128 eAbstractionObserver]: Analyzing ICFG ifeqn4f.c [2025-01-08 22:39:22,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:39:22,432 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ifeqn4f.c that has 1 procedures, 19 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-08 22:39:22,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:39:22,485 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@165d932f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:39:22,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:39:22,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:39:22,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:39:22,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:39:22,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:39:22,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:39:22,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1090041703, now seen corresponding path program 1 times [2025-01-08 22:39:22,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:39:22,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104674094] [2025-01-08 22:39:22,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:39:22,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:39:22,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:39:22,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:39:22,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:39:22,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:39:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:39:22,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:39:22,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104674094] [2025-01-08 22:39:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104674094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:39:22,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:39:22,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:39:22,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983264744] [2025-01-08 22:39:22,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:39:22,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:39:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:39:22,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:39:22,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:39:22,693 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:39:22,701 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2025-01-08 22:39:22,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:39:22,702 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-08 22:39:22,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:39:22,706 INFO L225 Difference]: With dead ends: 34 [2025-01-08 22:39:22,706 INFO L226 Difference]: Without dead ends: 16 [2025-01-08 22:39:22,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:39:22,715 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:39:22,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:39:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-08 22:39:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-08 22:39:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-01-08 22:39:22,738 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2025-01-08 22:39:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:39:22,738 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-01-08 22:39:22,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-01-08 22:39:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:39:22,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:39:22,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:39:22,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:39:22,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:39:22,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:39:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash 684965659, now seen corresponding path program 1 times [2025-01-08 22:39:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:39:22,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327668329] [2025-01-08 22:39:22,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:39:22,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:39:22,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:39:22,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:39:22,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:39:22,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:39:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:39:22,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:39:22,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327668329] [2025-01-08 22:39:22,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327668329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:39:22,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:39:22,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:39:22,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468053552] [2025-01-08 22:39:22,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:39:22,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:39:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:39:22,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:39:22,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:39:22,889 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:39:22,945 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2025-01-08 22:39:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:39:22,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-08 22:39:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:39:22,946 INFO L225 Difference]: With dead ends: 38 [2025-01-08 22:39:22,947 INFO L226 Difference]: Without dead ends: 27 [2025-01-08 22:39:22,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:39:22,948 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:39:22,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:39:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-08 22:39:22,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2025-01-08 22:39:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-01-08 22:39:22,953 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2025-01-08 22:39:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:39:22,953 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-01-08 22:39:22,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-01-08 22:39:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 22:39:22,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:39:22,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:39:22,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:39:22,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:39:22,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:39:22,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1625703390, now seen corresponding path program 1 times [2025-01-08 22:39:22,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:39:22,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69015193] [2025-01-08 22:39:22,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:39:22,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:39:22,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-08 22:39:22,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:39:22,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:39:22,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-08 22:39:22,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [602485339] [2025-01-08 22:39:22,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:39:22,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:39:22,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:39:22,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:39:22,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:39:23,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-08 22:39:23,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:39:23,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:39:23,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:39:23,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 22:39:23,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:39:23,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:39:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:39:23,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:39:23,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:39:23,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69015193] [2025-01-08 22:39:23,248 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-08 22:39:23,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602485339] [2025-01-08 22:39:23,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602485339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:39:23,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:39:23,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 22:39:23,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385366981] [2025-01-08 22:39:23,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:39:23,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:39:23,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:39:23,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:39:23,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:39:23,249 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:39:23,329 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2025-01-08 22:39:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:39:23,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-08 22:39:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:39:23,331 INFO L225 Difference]: With dead ends: 26 [2025-01-08 22:39:23,331 INFO L226 Difference]: Without dead ends: 24 [2025-01-08 22:39:23,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:39:23,332 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:39:23,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 44 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:39:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-08 22:39:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-01-08 22:39:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-01-08 22:39:23,339 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2025-01-08 22:39:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:39:23,340 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-01-08 22:39:23,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-01-08 22:39:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:39:23,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:39:23,341 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:39:23,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:39:23,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:39:23,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:39:23,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:39:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1283272144, now seen corresponding path program 1 times [2025-01-08 22:39:23,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:39:23,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159902954] [2025-01-08 22:39:23,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:39:23,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:39:23,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:39:23,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:39:23,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:39:23,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:39:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:39:23,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:39:23,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159902954] [2025-01-08 22:39:23,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159902954] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:39:23,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674612956] [2025-01-08 22:39:23,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:39:23,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:39:23,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:39:23,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:39:23,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:39:23,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:39:23,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:39:23,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:39:23,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:39:23,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:39:23,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:39:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:39:23,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:39:23,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:39:23,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674612956] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:39:23,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:39:23,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-08 22:39:23,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091617357] [2025-01-08 22:39:23,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:39:23,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:39:23,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:39:23,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:39:23,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:39:23,929 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:39:24,040 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2025-01-08 22:39:24,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:39:24,040 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-08 22:39:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:39:24,041 INFO L225 Difference]: With dead ends: 54 [2025-01-08 22:39:24,041 INFO L226 Difference]: Without dead ends: 36 [2025-01-08 22:39:24,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:39:24,042 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:39:24,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 29 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:39:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-08 22:39:24,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2025-01-08 22:39:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-01-08 22:39:24,047 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2025-01-08 22:39:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:39:24,048 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-01-08 22:39:24,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:39:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-01-08 22:39:24,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:39:24,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:39:24,048 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:39:24,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:39:24,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:39:24,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:39:24,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:39:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1353704851, now seen corresponding path program 1 times [2025-01-08 22:39:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:39:24,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290850792] [2025-01-08 22:39:24,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:39:24,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:39:24,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:39:24,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:39:24,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:39:24,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-08 22:39:24,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459005099] [2025-01-08 22:39:24,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:39:24,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:39:24,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:39:24,304 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:39:24,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:39:24,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:39:24,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:39:24,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:39:24,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:39:24,379 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-08 22:39:24,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:39:24,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:39:24,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:39:24,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:39:24,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-08 22:39:24,412 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-08 22:39:24,413 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:39:24,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:39:24,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:39:24,618 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-08 22:39:24,637 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:39:24,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:39:24 BoogieIcfgContainer [2025-01-08 22:39:24,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:39:24,640 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:39:24,640 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:39:24,640 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:39:24,641 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:39:22" (3/4) ... [2025-01-08 22:39:24,642 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-08 22:39:24,684 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 22. [2025-01-08 22:39:24,740 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:39:24,743 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:39:24,743 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:39:24,744 INFO L158 Benchmark]: Toolchain (without parser) took 2922.56ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 47.6MB in the end (delta: 57.4MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2025-01-08 22:39:24,744 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:39:24,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.93ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 93.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:39:24,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.69ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 93.0MB in the end (delta: 849.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:39:24,744 INFO L158 Benchmark]: Boogie Preprocessor took 44.02ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 90.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:39:24,745 INFO L158 Benchmark]: RCFGBuilder took 298.22ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 78.2MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:39:24,745 INFO L158 Benchmark]: TraceAbstraction took 2227.90ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 54.3MB in the end (delta: 23.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2025-01-08 22:39:24,745 INFO L158 Benchmark]: Witness Printer took 102.79ms. Allocated memory is still 142.6MB. Free memory was 54.3MB in the beginning and 47.6MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:39:24,746 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.93ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 93.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.69ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 93.0MB in the end (delta: 849.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.02ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 90.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 298.22ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 78.2MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2227.90ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 54.3MB in the end (delta: 23.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Witness Printer took 102.79ms. Allocated memory is still 142.6MB. Free memory was 54.3MB in the beginning and 47.6MB in the end (delta: 6.6MB). 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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; VAL [N=0] [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [N=2] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long *a = malloc(sizeof(long long)*N); [L29] long long *b = malloc(sizeof(long long)*N); [L31] i=0 VAL [N=2, a={-1:0}, b={-2:0}, i=0] [L31] COND TRUE i