./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s12iff.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s12iff.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b77a49aa9e2fe58d44cd30e10a0c2d54049996239a42f9eb129163eea28c3fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:48:29,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:48:29,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:48:29,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:48:29,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:48:29,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:48:29,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:48:29,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:48:29,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:48:29,162 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:48:29,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:48:29,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:48:29,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:48:29,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:48:29,162 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:48:29,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:48:29,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:48:29,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:48:29,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:48:29,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:48:29,164 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:48:29,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:48:29,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:48:29,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:48:29,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:48:29,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:48:29,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:48:29,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:48:29,164 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 ! 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 -> 3b77a49aa9e2fe58d44cd30e10a0c2d54049996239a42f9eb129163eea28c3fb [2025-03-08 00:48:29,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:48:29,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:48:29,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:48:29,399 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:48:29,399 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:48:29,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s12iff.c [2025-03-08 00:48:30,500 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce66816b/4ec2e2bb809b49be94918d6a15d2c372/FLAG75e97e412 [2025-03-08 00:48:30,732 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:48:30,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12iff.c [2025-03-08 00:48:30,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce66816b/4ec2e2bb809b49be94918d6a15d2c372/FLAG75e97e412 [2025-03-08 00:48:31,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce66816b/4ec2e2bb809b49be94918d6a15d2c372 [2025-03-08 00:48:31,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:48:31,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:48:31,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:48:31,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:48:31,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:48:31,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2854d9ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31, skipping insertion in model container [2025-03-08 00:48:31,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:48:31,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12iff.c[589,602] [2025-03-08 00:48:31,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:48:31,223 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:48:31,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12iff.c[589,602] [2025-03-08 00:48:31,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:48:31,250 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:48:31,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31 WrapperNode [2025-03-08 00:48:31,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:48:31,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:48:31,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:48:31,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:48:31,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,274 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2025-03-08 00:48:31,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:48:31,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:48:31,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:48:31,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:48:31,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,300 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-03-08 00:48:31,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:48:31,314 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:48:31,314 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:48:31,314 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:48:31,315 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (1/1) ... [2025-03-08 00:48:31,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:48:31,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:31,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:48:31,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:48:31,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:48:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:48:31,421 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:48:31,422 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:48:31,564 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-08 00:48:31,571 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:48:31,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:48:31,580 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:48:31,581 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:48:31,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:48:31 BoogieIcfgContainer [2025-03-08 00:48:31,581 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:48:31,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:48:31,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:48:31,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:48:31,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:48:31" (1/3) ... [2025-03-08 00:48:31,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb5c07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:48:31, skipping insertion in model container [2025-03-08 00:48:31,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:48:31" (2/3) ... [2025-03-08 00:48:31,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb5c07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:48:31, skipping insertion in model container [2025-03-08 00:48:31,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:48:31" (3/3) ... [2025-03-08 00:48:31,590 INFO L128 eAbstractionObserver]: Analyzing ICFG s12iff.c [2025-03-08 00:48:31,603 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:48:31,604 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s12iff.c that has 1 procedures, 19 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:48:31,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:48:31,657 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;@62f14764, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:48:31,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:48:31,660 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-03-08 00:48:31,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:48:31,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:31,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:31,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:31,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:31,668 INFO L85 PathProgramCache]: Analyzing trace with hash -411444654, now seen corresponding path program 1 times [2025-03-08 00:48:31,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:31,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328204308] [2025-03-08 00:48:31,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:31,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:31,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:48:31,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:48:31,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:31,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328204308] [2025-03-08 00:48:31,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328204308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:48:31,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:48:31,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:48:31,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107664765] [2025-03-08 00:48:31,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:48:31,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:48:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:31,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:48:31,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:48:31,823 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-03-08 00:48:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:31,831 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2025-03-08 00:48:31,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:48:31,833 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-03-08 00:48:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:31,837 INFO L225 Difference]: With dead ends: 34 [2025-03-08 00:48:31,837 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 00:48:31,839 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-03-08 00:48:31,841 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-03-08 00:48:31,841 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-03-08 00:48:31,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 00:48:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-08 00:48:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-03-08 00:48:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-08 00:48:31,861 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2025-03-08 00:48:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:31,861 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-08 00:48:31,862 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-03-08 00:48:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2025-03-08 00:48:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:48:31,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:31,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:31,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:48:31,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:31,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:31,863 INFO L85 PathProgramCache]: Analyzing trace with hash 476059027, now seen corresponding path program 1 times [2025-03-08 00:48:31,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:31,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013987134] [2025-03-08 00:48:31,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:31,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:31,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:48:31,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:48:31,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:31,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:32,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:32,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013987134] [2025-03-08 00:48:32,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013987134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:48:32,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:48:32,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:48:32,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580265324] [2025-03-08 00:48:32,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:48:32,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:48:32,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:32,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:48:32,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:48:32,006 INFO L87 Difference]: Start difference. First operand 15 states and 19 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-03-08 00:48:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:32,073 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2025-03-08 00:48:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:48:32,074 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-03-08 00:48:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:32,075 INFO L225 Difference]: With dead ends: 31 [2025-03-08 00:48:32,075 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 00:48:32,075 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-03-08 00:48:32,077 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:32,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 9 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 00:48:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2025-03-08 00:48:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-03-08 00:48:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 00:48:32,083 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-03-08 00:48:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:32,084 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 00:48:32,084 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-03-08 00:48:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 00:48:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:48:32,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:32,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:32,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:48:32,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:32,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash 330064146, now seen corresponding path program 1 times [2025-03-08 00:48:32,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:32,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195567841] [2025-03-08 00:48:32,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:32,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:48:32,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:48:32,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:32,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:48:32,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:48:32,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195567841] [2025-03-08 00:48:32,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195567841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:48:32,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964956094] [2025-03-08 00:48:32,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:32,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:32,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:48:32,445 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:48:32,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:48:32,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:48:32,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:48:32,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:32,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:48:32,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 00:48:32,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:48:32,550 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 15 treesize of output 1 [2025-03-08 00:48:32,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 00:48:32,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:48:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:32,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:48:32,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-08 00:48:32,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-08 00:48:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:48:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964956094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:48:32,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:48:32,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2025-03-08 00:48:32,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468038091] [2025-03-08 00:48:32,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:48:32,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:48:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:48:32,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:48:32,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:48:32,748 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 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-03-08 00:48:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:48:32,857 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2025-03-08 00:48:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:48:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 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 17 [2025-03-08 00:48:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:48:32,858 INFO L225 Difference]: With dead ends: 44 [2025-03-08 00:48:32,858 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 00:48:32,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:48:32,859 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:48:32,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 57 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:48:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 00:48:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2025-03-08 00:48:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-03-08 00:48:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-08 00:48:32,862 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 17 [2025-03-08 00:48:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:48:32,862 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-08 00:48:32,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 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-03-08 00:48:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-08 00:48:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:48:32,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:48:32,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:48:32,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:48:33,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:48:33,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:48:33,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:48:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2137518609, now seen corresponding path program 1 times [2025-03-08 00:48:33,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:48:33,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121272331] [2025-03-08 00:48:33,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:48:33,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:48:33,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:48:33,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:48:33,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:33,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:48:33,099 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 00:48:33,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:48:33,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:48:33,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:48:33,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:48:33,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 00:48:33,127 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 00:48:33,128 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:48:33,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:48:33,135 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 00:48:33,163 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:48:33,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:48:33 BoogieIcfgContainer [2025-03-08 00:48:33,168 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:48:33,168 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:48:33,168 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:48:33,168 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:48:33,169 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:48:31" (3/4) ... [2025-03-08 00:48:33,170 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 00:48:33,204 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 15. [2025-03-08 00:48:33,237 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:48:33,237 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:48:33,237 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:48:33,237 INFO L158 Benchmark]: Toolchain (without parser) took 2166.94ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 103.0MB in the end (delta: 3.1MB). Peak memory consumption was 372.4kB. Max. memory is 16.1GB. [2025-03-08 00:48:33,238 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:48:33,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.58ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 94.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:48:33,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.72ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.9MB in the end (delta: 528.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:48:33,239 INFO L158 Benchmark]: Boogie Preprocessor took 37.74ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:48:33,239 INFO L158 Benchmark]: IcfgBuilder took 267.17ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 78.5MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:48:33,239 INFO L158 Benchmark]: TraceAbstraction took 1583.82ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 108.6MB in the end (delta: -30.1MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2025-03-08 00:48:33,240 INFO L158 Benchmark]: Witness Printer took 68.81ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 103.0MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:48:33,241 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.58ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 94.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.72ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.9MB in the end (delta: 528.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.74ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 267.17ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 78.5MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1583.82ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 108.6MB in the end (delta: -30.1MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * Witness Printer took 68.81ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 103.0MB in the end (delta: 5.5MB). 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=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long sum[1]; [L29] int *a = malloc(sizeof(int)*N); [L31] sum[0] = 1 [L32] i=0 VAL [N=1, a={-1:0}, i=0, sum={5:0}] [L32] COND TRUE i