./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/num_conversion_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/bitvector/num_conversion_1.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 bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:02:51,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:02:51,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:02:51,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:02:51,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:02:51,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:02:51,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:02:51,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:02:51,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:02:51,118 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:02:51,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:02:51,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:02:51,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:02:51,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:02:51,120 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:02:51,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:02:51,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:02:51,120 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:02:51,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:02:51,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:02:51,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:02:51,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:02:51,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:02:51,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:02:51,121 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:02:51,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:02:51,121 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:02:51,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:02:51,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:02:51,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:02:51,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:02:51,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:02:51,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:02:51,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:02:51,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:02:51,122 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:02:51,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:02:51,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:02:51,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:02:51,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:02:51,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:02:51,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:02:51,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:02:51,122 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 -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2025-03-16 14:02:51,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:02:51,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:02:51,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:02:51,327 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:02:51,327 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:02:51,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2025-03-16 14:02:52,419 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d67703b6/f17441efef214801b5825f92eff3e26a/FLAG41d2109ff [2025-03-16 14:02:52,618 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:02:52,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2025-03-16 14:02:52,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d67703b6/f17441efef214801b5825f92eff3e26a/FLAG41d2109ff [2025-03-16 14:02:52,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d67703b6/f17441efef214801b5825f92eff3e26a [2025-03-16 14:02:52,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:02:52,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:02:52,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:02:52,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:02:52,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:02:52,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:02:52" (1/1) ... [2025-03-16 14:02:52,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f1a273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:52, skipping insertion in model container [2025-03-16 14:02:52,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:02:52" (1/1) ... [2025-03-16 14:02:52,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:02:53,084 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/bitvector/num_conversion_1.c[673,686] [2025-03-16 14:02:53,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:02:53,107 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:02:53,115 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/bitvector/num_conversion_1.c[673,686] [2025-03-16 14:02:53,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:02:53,129 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:02:53,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53 WrapperNode [2025-03-16 14:02:53,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:02:53,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:02:53,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:02:53,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:02:53,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (1/1) ... [2025-03-16 14:02:53,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (1/1) ... [2025-03-16 14:02:53,154 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 45 [2025-03-16 14:02:53,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:02:53,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:02:53,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:02:53,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:02:53,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (1/1) ... [2025-03-16 14:02:53,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (1/1) ... [2025-03-16 14:02:53,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (1/1) ... [2025-03-16 14:02:53,179 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:02:53,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (1/1) ... [2025-03-16 14:02:53,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (1/1) ... [2025-03-16 14:02:53,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (1/1) ... [2025-03-16 14:02:53,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (1/1) ... [2025-03-16 14:02:53,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (1/1) ... [2025-03-16 14:02:53,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (1/1) ... [2025-03-16 14:02:53,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:02:53,189 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:02:53,189 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:02:53,189 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:02:53,194 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (1/1) ... [2025-03-16 14:02:53,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:02:53,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:53,218 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-16 14:02:53,220 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-16 14:02:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:02:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:02:53,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:02:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:02:53,276 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:02:53,277 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:02:53,371 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-16 14:02:53,371 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:02:53,382 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:02:53,382 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:02:53,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:02:53 BoogieIcfgContainer [2025-03-16 14:02:53,382 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:02:53,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:02:53,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:02:53,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:02:53,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:02:52" (1/3) ... [2025-03-16 14:02:53,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6224ec58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:02:53, skipping insertion in model container [2025-03-16 14:02:53,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:53" (2/3) ... [2025-03-16 14:02:53,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6224ec58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:02:53, skipping insertion in model container [2025-03-16 14:02:53,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:02:53" (3/3) ... [2025-03-16 14:02:53,389 INFO L128 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2025-03-16 14:02:53,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:02:53,400 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG num_conversion_1.c that has 1 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:02:53,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:02:53,442 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;@1dd0f642, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:02:53,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:02:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 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-16 14:02:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 14:02:53,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:53,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 14:02:53,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:53,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1583823, now seen corresponding path program 1 times [2025-03-16 14:02:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:53,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421262240] [2025-03-16 14:02:53,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:53,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:53,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 14:02:53,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 14:02:53,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:53,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:53,633 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-16 14:02:53,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:53,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421262240] [2025-03-16 14:02:53,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421262240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:53,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:53,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:02:53,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107807163] [2025-03-16 14:02:53,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:53,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:02:53,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:53,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:02:53,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:02:53,655 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-16 14:02:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:53,691 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2025-03-16 14:02:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:02:53,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-16 14:02:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:53,696 INFO L225 Difference]: With dead ends: 42 [2025-03-16 14:02:53,697 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 14:02:53,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:02:53,702 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:53,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:02:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 14:02:53,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2025-03-16 14:02:53,717 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-03-16 14:02:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-03-16 14:02:53,721 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 4 [2025-03-16 14:02:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:53,721 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-16 14:02:53,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-16 14:02:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-03-16 14:02:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 14:02:53,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:53,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:53,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:02:53,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:53,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1421661831, now seen corresponding path program 1 times [2025-03-16 14:02:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:53,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548651301] [2025-03-16 14:02:53,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:53,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:53,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 14:02:53,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 14:02:53,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:53,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:53,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548651301] [2025-03-16 14:02:53,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548651301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:53,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:53,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:02:53,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399090204] [2025-03-16 14:02:53,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:53,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:02:53,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:53,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:02:53,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:53,843 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-16 14:02:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:53,867 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2025-03-16 14:02:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:02:53,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-16 14:02:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:53,868 INFO L225 Difference]: With dead ends: 31 [2025-03-16 14:02:53,868 INFO L226 Difference]: Without dead ends: 18 [2025-03-16 14:02:53,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:53,869 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:53,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:02:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-16 14:02:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-16 14:02:53,871 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-16 14:02:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-16 14:02:53,871 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-03-16 14:02:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:53,871 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-16 14:02:53,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-16 14:02:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-16 14:02:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 14:02:53,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:53,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:53,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:02:53,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:53,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1422585352, now seen corresponding path program 1 times [2025-03-16 14:02:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071800183] [2025-03-16 14:02:53,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:53,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 14:02:53,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 14:02:53,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:53,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:54,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:54,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071800183] [2025-03-16 14:02:54,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071800183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:54,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:54,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:02:54,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212126874] [2025-03-16 14:02:54,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:54,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:02:54,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:54,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:02:54,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:02:54,063 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-16 14:02:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:54,109 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2025-03-16 14:02:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:02:54,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-16 14:02:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:54,111 INFO L225 Difference]: With dead ends: 40 [2025-03-16 14:02:54,111 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 14:02:54,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:02:54,112 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:54,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 23 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:02:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 14:02:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-03-16 14:02:54,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-16 14:02:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-16 14:02:54,118 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2025-03-16 14:02:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:54,119 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-16 14:02:54,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-16 14:02:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-16 14:02:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 14:02:54,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:54,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:54,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:02:54,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:54,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:54,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1910280938, now seen corresponding path program 1 times [2025-03-16 14:02:54,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:54,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418350120] [2025-03-16 14:02:54,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:54,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:54,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 14:02:54,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 14:02:54,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:54,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:54,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:54,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418350120] [2025-03-16 14:02:54,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418350120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:54,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597336476] [2025-03-16 14:02:54,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:54,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:54,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:54,196 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-16 14:02:54,197 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-16 14:02:54,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 14:02:54,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 14:02:54,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:54,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:54,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 14:02:54,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:54,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:02:54,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597336476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:54,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:02:54,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-16 14:02:54,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767542127] [2025-03-16 14:02:54,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:54,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:02:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:54,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:02:54,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:02:54,308 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-16 14:02:54,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:54,341 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2025-03-16 14:02:54,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:02:54,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2025-03-16 14:02:54,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:54,342 INFO L225 Difference]: With dead ends: 55 [2025-03-16 14:02:54,342 INFO L226 Difference]: Without dead ends: 37 [2025-03-16 14:02:54,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:02:54,343 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:54,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 41 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:02:54,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-16 14:02:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2025-03-16 14:02:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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-03-16 14:02:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-03-16 14:02:54,346 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 13 [2025-03-16 14:02:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:54,346 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-16 14:02:54,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-16 14:02:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-03-16 14:02:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 14:02:54,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:54,347 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:54,352 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-16 14:02:54,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:54,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:54,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash 343532739, now seen corresponding path program 1 times [2025-03-16 14:02:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:54,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695999316] [2025-03-16 14:02:54,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:54,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:54,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 14:02:54,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 14:02:54,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:54,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:54,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:54,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695999316] [2025-03-16 14:02:54,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695999316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:54,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732567638] [2025-03-16 14:02:54,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:54,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:54,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:54,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:54,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:02:54,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 14:02:54,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 14:02:54,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:54,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:54,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 14:02:54,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:54,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:54,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732567638] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:54,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:02:54,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2025-03-16 14:02:54,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731273848] [2025-03-16 14:02:54,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:54,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 14:02:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:54,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 14:02:54,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-16 14:02:54,876 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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-16 14:02:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:55,040 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2025-03-16 14:02:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 14:02:55,041 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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 21 [2025-03-16 14:02:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:55,041 INFO L225 Difference]: With dead ends: 107 [2025-03-16 14:02:55,041 INFO L226 Difference]: Without dead ends: 83 [2025-03-16 14:02:55,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=208, Unknown=0, NotChecked=0, Total=342 [2025-03-16 14:02:55,042 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 143 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:55,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 129 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-16 14:02:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2025-03-16 14:02:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 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-16 14:02:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2025-03-16 14:02:55,047 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 21 [2025-03-16 14:02:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:55,047 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2025-03-16 14:02:55,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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-16 14:02:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2025-03-16 14:02:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 14:02:55,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:55,048 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:55,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:02:55,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:55,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:55,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:55,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1471815305, now seen corresponding path program 2 times [2025-03-16 14:02:55,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:55,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916568668] [2025-03-16 14:02:55,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:02:55,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:55,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-16 14:02:55,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 14:02:55,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:02:55,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:55,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916568668] [2025-03-16 14:02:55,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916568668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622895389] [2025-03-16 14:02:55,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:02:55,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:55,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:55,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:55,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:02:55,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-16 14:02:55,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 14:02:55,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:02:55,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:55,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 14:02:55,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:55,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:56,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622895389] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:56,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:02:56,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2025-03-16 14:02:56,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888756419] [2025-03-16 14:02:56,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:56,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 14:02:56,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:56,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 14:02:56,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2025-03-16 14:02:56,060 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 25 states, 25 states have (on average 6.12) internal successors, (153), 25 states have internal predecessors, (153), 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-16 14:02:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:56,546 INFO L93 Difference]: Finished difference Result 248 states and 327 transitions. [2025-03-16 14:02:56,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 14:02:56,546 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.12) internal successors, (153), 25 states have internal predecessors, (153), 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 53 [2025-03-16 14:02:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:56,547 INFO L225 Difference]: With dead ends: 248 [2025-03-16 14:02:56,549 INFO L226 Difference]: Without dead ends: 177 [2025-03-16 14:02:56,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2025-03-16 14:02:56,550 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 296 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:56,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 447 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:02:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-16 14:02:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2025-03-16 14:02:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 169 states have internal predecessors, (218), 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-16 14:02:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 218 transitions. [2025-03-16 14:02:56,565 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 218 transitions. Word has length 53 [2025-03-16 14:02:56,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:56,566 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 218 transitions. [2025-03-16 14:02:56,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.12) internal successors, (153), 25 states have internal predecessors, (153), 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-16 14:02:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 218 transitions. [2025-03-16 14:02:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 14:02:56,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:56,567 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:56,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:56,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:56,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:56,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:56,768 INFO L85 PathProgramCache]: Analyzing trace with hash 96465361, now seen corresponding path program 3 times [2025-03-16 14:02:56,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:56,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689268066] [2025-03-16 14:02:56,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 14:02:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:56,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 9 equivalence classes. [2025-03-16 14:02:56,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 14:02:56,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-16 14:02:56,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 14:02:56,797 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 14:02:56,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 14:02:56,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 14:02:56,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:56,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 14:02:56,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 14:02:56,833 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 14:02:56,834 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:02:56,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:02:56,838 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-03-16 14:02:56,865 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:02:56,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:02:56 BoogieIcfgContainer [2025-03-16 14:02:56,869 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:02:56,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:02:56,870 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:02:56,871 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:02:56,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:02:53" (3/4) ... [2025-03-16 14:02:56,873 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 14:02:56,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:02:56,874 INFO L158 Benchmark]: Toolchain (without parser) took 3896.57ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 80.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2025-03-16 14:02:56,874 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:02:56,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.18ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 95.3MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:02:56,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.02ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 92.7MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:02:56,874 INFO L158 Benchmark]: Boogie Preprocessor took 31.00ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:02:56,875 INFO L158 Benchmark]: IcfgBuilder took 192.90ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 79.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:02:56,875 INFO L158 Benchmark]: TraceAbstraction took 3484.84ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 80.2MB in the end (delta: -1.7MB). Peak memory consumption was 241.5kB. Max. memory is 16.1GB. [2025-03-16 14:02:56,875 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 80.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:02:56,876 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 152.18ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 95.3MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.02ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 92.7MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.00ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 192.90ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 79.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3484.84ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 80.2MB in the end (delta: -1.7MB). Peak memory consumption was 241.5kB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 80.2MB in the end (delta: 41.6kB). 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 - UnprovableResult [Line: 16]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 32, overapproximation of bitwiseAnd at line 33. Possible FailurePath: [L24] unsigned char x; [L25] unsigned char y; [L26] unsigned char c; [L28] x = 37 [L29] y = 0 [L30] c = 0 VAL [c=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 VAL [c=0, x=37, y=0] [L32] EXPR ((unsigned char)1) << c VAL [c=0, x=37, y=0] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=0, i=1, x=37, y=0] [L33] unsigned char bit = x & i; [L34] COND TRUE bit != (unsigned char)0 [L35] y = y + i VAL [c=0, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=1, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=1, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=1, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=1, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=2, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=2, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=2, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=2, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=3, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=3, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=3, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=3, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=4, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=4, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=4, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=4, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=5, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=5, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=5, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=5, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=6, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=6, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=6, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=6, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND TRUE c < (unsigned char)8 VAL [c=7, x=37, y=1] [L32] EXPR ((unsigned char)1) << c VAL [c=7, x=37, y=1] [L32] unsigned char i = ((unsigned char)1) << c; [L33] EXPR x & i VAL [c=7, i=256, x=37, y=1] [L33] unsigned char bit = x & i; [L34] COND FALSE !(bit != (unsigned char)0) VAL [c=7, i=256, x=37, y=1] [L37] c = c + ((unsigned char)1) [L31] COND FALSE !(c < (unsigned char)8) [L39] CALL __VERIFIER_assert(x == y) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 22 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 7, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 487 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 487 mSDsluCounter, 704 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 569 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 553 IncrementalHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 135 mSDtfsCounter, 553 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=6, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 1669 SizeOfPredicates, 5 NumberOfNonLiveVariables, 252 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 31/394 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 14:02:56,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/num_conversion_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:02:58,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:02:58,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 14:02:58,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:02:58,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:02:58,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:02:58,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:02:58,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:02:58,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:02:58,697 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:02:58,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:02:58,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:02:58,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:02:58,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:02:58,698 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:02:58,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:02:58,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:02:58,698 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:02:58,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:02:58,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:02:58,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:02:58,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:02:58,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:02:58,699 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 14:02:58,699 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 14:02:58,699 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 14:02:58,699 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:02:58,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:02:58,699 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:02:58,699 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:02:58,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:02:58,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:02:58,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:02:58,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:02:58,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:02:58,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:02:58,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:02:58,700 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:02:58,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:02:58,700 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 14:02:58,700 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 14:02:58,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:02:58,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:02:58,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:02:58,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:02:58,701 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 -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2025-03-16 14:02:58,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:02:58,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:02:58,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:02:58,917 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:02:58,918 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:02:58,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2025-03-16 14:03:00,069 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2bd8f6f/b42e449dcac4433e9892736cd4ff6f42/FLAG9392f7ac7 [2025-03-16 14:03:00,233 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:03:00,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2025-03-16 14:03:00,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2bd8f6f/b42e449dcac4433e9892736cd4ff6f42/FLAG9392f7ac7 [2025-03-16 14:03:00,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2bd8f6f/b42e449dcac4433e9892736cd4ff6f42 [2025-03-16 14:03:00,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:03:00,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:03:00,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:03:00,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:03:00,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:03:00,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a518f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00, skipping insertion in model container [2025-03-16 14:03:00,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:03:00,767 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/bitvector/num_conversion_1.c[673,686] [2025-03-16 14:03:00,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:03:00,790 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:03:00,797 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/bitvector/num_conversion_1.c[673,686] [2025-03-16 14:03:00,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:03:00,816 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:03:00,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00 WrapperNode [2025-03-16 14:03:00,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:03:00,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:03:00,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:03:00,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:03:00,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,839 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2025-03-16 14:03:00,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:03:00,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:03:00,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:03:00,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:03:00,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,857 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:03:00,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:03:00,871 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:03:00,871 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:03:00,871 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:03:00,872 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (1/1) ... [2025-03-16 14:03:00,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:03:00,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:00,900 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-16 14:03:00,905 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-16 14:03:00,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:03:00,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:03:00,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:03:00,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 14:03:00,965 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:03:00,967 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:03:01,069 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-16 14:03:01,069 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:03:01,078 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:03:01,079 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:03:01,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:01 BoogieIcfgContainer [2025-03-16 14:03:01,079 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:03:01,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:03:01,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:03:01,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:03:01,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:03:00" (1/3) ... [2025-03-16 14:03:01,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29379d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:03:01, skipping insertion in model container [2025-03-16 14:03:01,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:00" (2/3) ... [2025-03-16 14:03:01,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29379d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:03:01, skipping insertion in model container [2025-03-16 14:03:01,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:01" (3/3) ... [2025-03-16 14:03:01,087 INFO L128 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2025-03-16 14:03:01,099 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:03:01,101 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG num_conversion_1.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:03:01,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:03:01,149 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;@6a6bba56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:03:01,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:03:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 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-16 14:03:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 14:03:01,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:01,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 14:03:01,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:01,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:01,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1226331, now seen corresponding path program 1 times [2025-03-16 14:03:01,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:03:01,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118661583] [2025-03-16 14:03:01,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:01,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:01,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:01,178 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-16 14:03:01,179 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-16 14:03:01,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 14:03:01,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 14:03:01,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:01,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:01,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:03:01,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:01,261 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-16 14:03:01,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:03:01,262 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:03:01,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118661583] [2025-03-16 14:03:01,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118661583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:01,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:01,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:03:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122884772] [2025-03-16 14:03:01,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:01,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:01,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:03:01,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:01,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:01,282 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-16 14:03:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:01,302 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2025-03-16 14:03:01,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:01,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-16 14:03:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:01,308 INFO L225 Difference]: With dead ends: 19 [2025-03-16 14:03:01,309 INFO L226 Difference]: Without dead ends: 10 [2025-03-16 14:03:01,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:01,312 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:01,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-16 14:03:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2025-03-16 14:03:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-16 14:03:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-03-16 14:03:01,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 4 [2025-03-16 14:03:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:01,338 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-16 14:03:01,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-16 14:03:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2025-03-16 14:03:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 14:03:01,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:01,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:01,346 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-16 14:03:01,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:01,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:01,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:01,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2002744091, now seen corresponding path program 1 times [2025-03-16 14:03:01,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:03:01,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496431433] [2025-03-16 14:03:01,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:01,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:01,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:01,546 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:01,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:03:01,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 14:03:01,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 14:03:01,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:01,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:01,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 14:03:01,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:01,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:01,667 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:03:01,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496431433] [2025-03-16 14:03:01,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496431433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:01,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:03:01,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2025-03-16 14:03:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792440787] [2025-03-16 14:03:01,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:01,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:03:01,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:03:01,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:03:01,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:03:01,671 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-16 14:03:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:01,718 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2025-03-16 14:03:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:03:01,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 7 [2025-03-16 14:03:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:01,719 INFO L225 Difference]: With dead ends: 20 [2025-03-16 14:03:01,719 INFO L226 Difference]: Without dead ends: 17 [2025-03-16 14:03:01,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:03:01,720 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:01,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-16 14:03:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-16 14:03:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-16 14:03:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-16 14:03:01,729 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 7 [2025-03-16 14:03:01,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:01,730 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-16 14:03:01,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-16 14:03:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-03-16 14:03:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 14:03:01,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:01,730 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1] [2025-03-16 14:03:01,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:03:01,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:01,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:01,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2032459227, now seen corresponding path program 2 times [2025-03-16 14:03:01,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:03:01,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115255802] [2025-03-16 14:03:01,936 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:03:01,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:01,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:01,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:01,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:03:01,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-16 14:03:01,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 14:03:01,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:03:01,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:01,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 14:03:01,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 14:03:02,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 14:03:02,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:03:02,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115255802] [2025-03-16 14:03:02,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115255802] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:02,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:03:02,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-16 14:03:02,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287443647] [2025-03-16 14:03:02,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:02,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:03:02,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:03:02,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:03:02,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:03:02,112 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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-16 14:03:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:02,163 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2025-03-16 14:03:02,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 14:03:02,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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-03-16 14:03:02,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:02,164 INFO L225 Difference]: With dead ends: 30 [2025-03-16 14:03:02,164 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 14:03:02,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:03:02,164 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:02,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 14:03:02,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-03-16 14:03:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-16 14:03:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-03-16 14:03:02,168 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 16 [2025-03-16 14:03:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:02,168 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-16 14:03:02,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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-16 14:03:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2025-03-16 14:03:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 14:03:02,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:02,168 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1] [2025-03-16 14:03:02,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 14:03:02,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:02,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:02,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:02,373 INFO L85 PathProgramCache]: Analyzing trace with hash 236431389, now seen corresponding path program 1 times [2025-03-16 14:03:02,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:03:02,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895447990] [2025-03-16 14:03:02,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:02,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:02,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:02,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:02,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:03:02,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 14:03:02,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 14:03:02,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:02,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:02,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 14:03:02,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:02,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:02,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:03:02,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895447990] [2025-03-16 14:03:02,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895447990] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:02,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:03:02,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2025-03-16 14:03:02,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408774942] [2025-03-16 14:03:02,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:02,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 14:03:02,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:03:02,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 14:03:02,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:03:02,592 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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-03-16 14:03:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:02,703 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2025-03-16 14:03:02,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 14:03:02,703 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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) Word has length 16 [2025-03-16 14:03:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:02,704 INFO L225 Difference]: With dead ends: 38 [2025-03-16 14:03:02,704 INFO L226 Difference]: Without dead ends: 35 [2025-03-16 14:03:02,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:03:02,706 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:02,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 53 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:02,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-16 14:03:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-16 14:03:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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-16 14:03:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2025-03-16 14:03:02,713 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 16 [2025-03-16 14:03:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:02,714 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-03-16 14:03:02,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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-03-16 14:03:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2025-03-16 14:03:02,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 14:03:02,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:02,714 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1] [2025-03-16 14:03:02,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 14:03:02,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:02,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:02,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:02,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1181533027, now seen corresponding path program 2 times [2025-03-16 14:03:02,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:03:02,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670363835] [2025-03-16 14:03:02,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:03:02,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:02,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:02,917 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:02,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:03:02,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-16 14:03:02,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 14:03:02,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:03:02,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:02,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 14:03:02,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:03:03,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:03:03,178 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:03:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670363835] [2025-03-16 14:03:03,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670363835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:03,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:03:03,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-16 14:03:03,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190204648] [2025-03-16 14:03:03,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:03,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 14:03:03,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:03:03,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 14:03:03,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:03:03,180 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 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-16 14:03:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:03,500 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2025-03-16 14:03:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 14:03:03,500 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 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 28 [2025-03-16 14:03:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:03,500 INFO L225 Difference]: With dead ends: 57 [2025-03-16 14:03:03,500 INFO L226 Difference]: Without dead ends: 37 [2025-03-16 14:03:03,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2025-03-16 14:03:03,504 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:03,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 53 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-16 14:03:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-03-16 14:03:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-16 14:03:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-03-16 14:03:03,510 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 28 [2025-03-16 14:03:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:03,510 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-03-16 14:03:03,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 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-16 14:03:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-03-16 14:03:03,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 14:03:03,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:03,510 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1] [2025-03-16 14:03:03,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 14:03:03,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:03,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:03,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash 56642204, now seen corresponding path program 3 times [2025-03-16 14:03:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:03:03,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33010039] [2025-03-16 14:03:03,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 14:03:03,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:03,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:03,713 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:03,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 14:03:03,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 9 equivalence classes. [2025-03-16 14:03:03,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 14:03:03,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-16 14:03:03,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:03,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 14:03:03,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:04,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:05,085 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:03:05,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33010039] [2025-03-16 14:03:05,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33010039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:05,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:03:05,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2025-03-16 14:03:05,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82139651] [2025-03-16 14:03:05,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:05,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-16 14:03:05,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:03:05,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-16 14:03:05,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 14:03:05,087 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 35 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 34 states have internal predecessors, (55), 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-16 14:03:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:08,040 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2025-03-16 14:03:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-16 14:03:08,041 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 34 states have internal predecessors, (55), 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 28 [2025-03-16 14:03:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:08,042 INFO L225 Difference]: With dead ends: 111 [2025-03-16 14:03:08,042 INFO L226 Difference]: Without dead ends: 75 [2025-03-16 14:03:08,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=814, Invalid=2156, Unknown=0, NotChecked=0, Total=2970 [2025-03-16 14:03:08,043 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 72 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:08,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 142 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:03:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-16 14:03:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 42. [2025-03-16 14:03:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 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-16 14:03:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-16 14:03:08,050 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 28 [2025-03-16 14:03:08,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:08,050 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-16 14:03:08,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 34 states have internal predecessors, (55), 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-16 14:03:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-16 14:03:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 14:03:08,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:08,051 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1] [2025-03-16 14:03:08,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 14:03:08,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:08,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:08,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -352182021, now seen corresponding path program 4 times [2025-03-16 14:03:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:03:08,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142346450] [2025-03-16 14:03:08,253 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 14:03:08,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:08,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:08,254 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:08,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 14:03:08,274 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-16 14:03:08,282 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 14:03:08,282 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 14:03:08,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:08,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 14:03:08,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 14:03:08,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 14:03:08,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:03:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142346450] [2025-03-16 14:03:08,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142346450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:08,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:03:08,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 14:03:08,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963479975] [2025-03-16 14:03:08,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:08,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 14:03:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:03:08,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 14:03:08,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:03:08,379 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-16 14:03:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:08,406 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2025-03-16 14:03:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 14:03:08,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 28 [2025-03-16 14:03:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:08,406 INFO L225 Difference]: With dead ends: 42 [2025-03-16 14:03:08,406 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:03:08,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-16 14:03:08,407 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:08,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:03:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:03:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-16 14:03:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:03:08,408 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-03-16 14:03:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:08,408 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:03:08,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-16 14:03:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:03:08,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:03:08,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:03:08,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 14:03:08,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:08,613 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1] [2025-03-16 14:03:08,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:03:08,675 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:03:08,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:03:08 BoogieIcfgContainer [2025-03-16 14:03:08,688 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:03:08,689 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:03:08,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:03:08,690 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:03:08,690 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:01" (3/4) ... [2025-03-16 14:03:08,692 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:03:08,698 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-16 14:03:08,699 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:03:08,699 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:03:08,699 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:03:08,752 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:03:08,752 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:03:08,752 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:03:08,753 INFO L158 Benchmark]: Toolchain (without parser) took 8104.32ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 84.8MB in the end (delta: 7.2MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2025-03-16 14:03:08,753 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:08,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.87ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 80.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:08,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.95ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.6MB in the end (delta: 927.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:08,754 INFO L158 Benchmark]: Boogie Preprocessor took 28.58ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:08,754 INFO L158 Benchmark]: IcfgBuilder took 208.52ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 68.3MB in the end (delta: 10.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:03:08,754 INFO L158 Benchmark]: TraceAbstraction took 7607.43ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 89.7MB in the end (delta: -22.0MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2025-03-16 14:03:08,754 INFO L158 Benchmark]: Witness Printer took 63.02ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 84.8MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:08,756 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.26ms. Allocated memory is still 83.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.87ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 80.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.95ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.6MB in the end (delta: 927.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.58ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 208.52ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 68.3MB in the end (delta: 10.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7607.43ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 89.7MB in the end (delta: -22.0MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * Witness Printer took 63.02ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 84.8MB in the end (delta: 4.9MB). 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 - PositiveResult [Line: 16]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 12 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 7, TraceHistogramMax: 8, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 663 IncrementalHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 55 mSDtfsCounter, 663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 37 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 3460 SizeOfPredicates, 9 NumberOfNonLiveVariables, 323 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 342/642 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Location Invariant Derived location invariant: (((((((((((x == 37) && (y == 37)) && (c == 8)) || (((y == 1) && (x == 37)) && (c == 1))) || (((x == 37) && (c == 6)) && (y == 37))) || (((c == 3) && (x == 37)) && (y == 5))) || (((x == 37) && (c == 4)) && (y == 5))) || (((c == 5) && (x == 37)) && (y == 5))) || (((c == 7) && (x == 37)) && (y == 37))) || (((y == 0) && (c == 0)) && (x == 37))) || (((y == 1) && (c == 2)) && (x == 37))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:03:08,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE