./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-50.i --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/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-50.i -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 519864e53b03022f19665d838cae53af0d2c6f0a1e59ab679c7909b75395a350 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:17:56,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:17:56,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:17:56,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:17:56,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:17:56,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:17:56,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:17:56,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:17:56,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:17:56,981 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:17:56,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:17:56,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:17:56,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:17:56,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:17:56,982 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:17:56,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:17:56,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:17:56,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:17:56,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:17:56,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:17:56,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:17:56,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:17:56,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:17:56,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:17:56,983 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:17:56,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:17:56,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:17:56,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:17:56,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:17:56,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:17:56,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:17:56,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:17:56,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:17:56,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:17:56,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:17:56,984 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:17:56,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:17:56,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:17:56,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:17:56,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:17:56,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:17:56,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:17:56,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:17:56,985 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 -> 519864e53b03022f19665d838cae53af0d2c6f0a1e59ab679c7909b75395a350 [2025-03-17 03:17:57,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:17:57,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:17:57,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:17:57,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:17:57,248 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:17:57,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-50.i [2025-03-17 03:17:58,435 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee0630f3/f7e9228dd8fe4166853ae016384443d7/FLAG327f459fa [2025-03-17 03:17:58,710 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:17:58,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-50.i [2025-03-17 03:17:58,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee0630f3/f7e9228dd8fe4166853ae016384443d7/FLAG327f459fa [2025-03-17 03:17:59,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee0630f3/f7e9228dd8fe4166853ae016384443d7 [2025-03-17 03:17:59,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:17:59,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:17:59,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:17:59,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:17:59,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:17:59,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@224dd94e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59, skipping insertion in model container [2025-03-17 03:17:59,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:17:59,165 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-50.i[916,929] [2025-03-17 03:17:59,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:17:59,270 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:17:59,281 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-50.i[916,929] [2025-03-17 03:17:59,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:17:59,350 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:17:59,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59 WrapperNode [2025-03-17 03:17:59,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:17:59,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:17:59,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:17:59,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:17:59,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,423 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 277 [2025-03-17 03:17:59,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:17:59,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:17:59,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:17:59,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:17:59,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,467 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-17 03:17:59,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:17:59,499 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:17:59,499 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:17:59,499 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:17:59,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (1/1) ... [2025-03-17 03:17:59,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:17:59,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:17:59,528 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-17 03:17:59,533 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-17 03:17:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:17:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:17:59,549 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:17:59,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:17:59,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:17:59,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:17:59,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:17:59,628 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:18:00,095 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L212: havoc property_#t~bitwise28#1;havoc property_#t~short29#1;havoc property_#t~bitwise30#1;havoc property_#t~short31#1;havoc property_#t~short32#1; [2025-03-17 03:18:00,135 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-03-17 03:18:00,135 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:18:00,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:18:00,152 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:18:00,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:18:00 BoogieIcfgContainer [2025-03-17 03:18:00,152 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:18:00,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:18:00,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:18:00,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:18:00,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:17:59" (1/3) ... [2025-03-17 03:18:00,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6579c771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:18:00, skipping insertion in model container [2025-03-17 03:18:00,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:17:59" (2/3) ... [2025-03-17 03:18:00,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6579c771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:18:00, skipping insertion in model container [2025-03-17 03:18:00,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:18:00" (3/3) ... [2025-03-17 03:18:00,160 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-50.i [2025-03-17 03:18:00,171 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:18:00,172 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-50.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:18:00,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:18:00,227 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;@6595b395, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:18:00,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:18:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 80 states have (on average 1.4) internal successors, (112), 81 states have internal predecessors, (112), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 03:18:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-17 03:18:00,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:18:00,248 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:18:00,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:18:00,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:18:00,252 INFO L85 PathProgramCache]: Analyzing trace with hash -794824689, now seen corresponding path program 1 times [2025-03-17 03:18:00,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:18:00,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74554862] [2025-03-17 03:18:00,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:18:00,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:18:00,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 03:18:00,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 03:18:00,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:00,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:18:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2025-03-17 03:18:00,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:18:00,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74554862] [2025-03-17 03:18:00,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74554862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:18:00,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167088974] [2025-03-17 03:18:00,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:18:00,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:18:00,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:18:00,661 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-17 03:18:00,662 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-17 03:18:00,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 03:18:00,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 03:18:00,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:00,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:18:00,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:18:00,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:18:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2025-03-17 03:18:00,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:18:00,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167088974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:18:00,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:18:00,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:18:00,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865382492] [2025-03-17 03:18:00,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:18:00,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:18:00,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:18:00,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:18:00,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:18:00,940 INFO L87 Difference]: Start difference. First operand has 120 states, 80 states have (on average 1.4) internal successors, (112), 81 states have internal predecessors, (112), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-17 03:18:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:18:00,983 INFO L93 Difference]: Finished difference Result 237 states and 407 transitions. [2025-03-17 03:18:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:18:00,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) Word has length 240 [2025-03-17 03:18:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:18:00,991 INFO L225 Difference]: With dead ends: 237 [2025-03-17 03:18:00,992 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 03:18:00,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:18:00,997 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:18:00,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:18:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 03:18:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-17 03:18:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 states have internal predecessors, (108), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 03:18:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 182 transitions. [2025-03-17 03:18:01,036 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 182 transitions. Word has length 240 [2025-03-17 03:18:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:18:01,037 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 182 transitions. [2025-03-17 03:18:01,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-17 03:18:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 182 transitions. [2025-03-17 03:18:01,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-17 03:18:01,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:18:01,042 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:18:01,054 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-17 03:18:01,243 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,SelfDestructingSolverStorable0 [2025-03-17 03:18:01,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:18:01,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:18:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1807617044, now seen corresponding path program 1 times [2025-03-17 03:18:01,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:18:01,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180678967] [2025-03-17 03:18:01,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:18:01,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:18:01,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 03:18:01,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 03:18:01,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:01,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:18:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 03:18:01,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:18:01,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180678967] [2025-03-17 03:18:01,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180678967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:18:01,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:18:01,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:18:01,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168863535] [2025-03-17 03:18:01,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:18:01,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:18:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:18:01,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:18:01,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:18:01,553 INFO L87 Difference]: Start difference. First operand 118 states and 182 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 03:18:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:18:01,597 INFO L93 Difference]: Finished difference Result 236 states and 365 transitions. [2025-03-17 03:18:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:18:01,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 240 [2025-03-17 03:18:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:18:01,603 INFO L225 Difference]: With dead ends: 236 [2025-03-17 03:18:01,603 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 03:18:01,606 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-17 03:18:01,606 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:18:01,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:18:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 03:18:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-17 03:18:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 03:18:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 183 transitions. [2025-03-17 03:18:01,625 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 183 transitions. Word has length 240 [2025-03-17 03:18:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:18:01,627 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 183 transitions. [2025-03-17 03:18:01,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 03:18:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 183 transitions. [2025-03-17 03:18:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-17 03:18:01,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:18:01,631 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:18:01,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:18:01,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:18:01,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:18:01,632 INFO L85 PathProgramCache]: Analyzing trace with hash 300065235, now seen corresponding path program 1 times [2025-03-17 03:18:01,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:18:01,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416495176] [2025-03-17 03:18:01,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:18:01,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:18:01,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 03:18:01,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 03:18:01,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:01,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:18:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 03:18:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:18:02,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416495176] [2025-03-17 03:18:02,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416495176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:18:02,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:18:02,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:18:02,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129598993] [2025-03-17 03:18:02,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:18:02,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:18:02,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:18:02,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:18:02,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:18:02,301 INFO L87 Difference]: Start difference. First operand 119 states and 183 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 03:18:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:18:02,499 INFO L93 Difference]: Finished difference Result 237 states and 365 transitions. [2025-03-17 03:18:02,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:18:02,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 240 [2025-03-17 03:18:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:18:02,501 INFO L225 Difference]: With dead ends: 237 [2025-03-17 03:18:02,501 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 03:18:02,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-17 03:18:02,502 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 182 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:18:02,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 165 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:18:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 03:18:02,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-17 03:18:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 03:18:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 179 transitions. [2025-03-17 03:18:02,517 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 179 transitions. Word has length 240 [2025-03-17 03:18:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:18:02,518 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 179 transitions. [2025-03-17 03:18:02,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 03:18:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 179 transitions. [2025-03-17 03:18:02,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-17 03:18:02,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:18:02,521 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:18:02,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:18:02,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:18:02,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:18:02,522 INFO L85 PathProgramCache]: Analyzing trace with hash 311381362, now seen corresponding path program 1 times [2025-03-17 03:18:02,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:18:02,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759259045] [2025-03-17 03:18:02,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:18:02,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:18:02,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 03:18:02,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 03:18:02,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:02,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:18:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 9 proven. 99 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-17 03:18:03,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:18:03,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759259045] [2025-03-17 03:18:03,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759259045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:18:03,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606775479] [2025-03-17 03:18:03,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:18:03,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:18:03,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:18:03,128 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-17 03:18:03,142 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-17 03:18:03,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 03:18:03,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 03:18:03,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:03,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:18:03,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 03:18:03,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:18:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 820 proven. 186 refuted. 0 times theorem prover too weak. 1658 trivial. 0 not checked. [2025-03-17 03:18:04,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:18:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 24 proven. 189 refuted. 0 times theorem prover too weak. 2451 trivial. 0 not checked. [2025-03-17 03:18:05,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606775479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:18:05,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:18:05,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 25 [2025-03-17 03:18:05,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960642245] [2025-03-17 03:18:05,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:18:05,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 03:18:05,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:18:05,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 03:18:05,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-03-17 03:18:05,227 INFO L87 Difference]: Start difference. First operand 119 states and 179 transitions. Second operand has 25 states, 25 states have (on average 5.84) internal successors, (146), 25 states have internal predecessors, (146), 6 states have call successors, (105), 3 states have call predecessors, (105), 7 states have return successors, (107), 6 states have call predecessors, (107), 6 states have call successors, (107) [2025-03-17 03:18:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:18:06,408 INFO L93 Difference]: Finished difference Result 327 states and 469 transitions. [2025-03-17 03:18:06,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-17 03:18:06,409 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.84) internal successors, (146), 25 states have internal predecessors, (146), 6 states have call successors, (105), 3 states have call predecessors, (105), 7 states have return successors, (107), 6 states have call predecessors, (107), 6 states have call successors, (107) Word has length 240 [2025-03-17 03:18:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:18:06,414 INFO L225 Difference]: With dead ends: 327 [2025-03-17 03:18:06,415 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 03:18:06,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=678, Invalid=2628, Unknown=0, NotChecked=0, Total=3306 [2025-03-17 03:18:06,417 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 696 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:18:06,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 727 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:18:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 03:18:06,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 187. [2025-03-17 03:18:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 144 states have internal predecessors, (189), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 03:18:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 265 transitions. [2025-03-17 03:18:06,433 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 265 transitions. Word has length 240 [2025-03-17 03:18:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:18:06,434 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 265 transitions. [2025-03-17 03:18:06,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.84) internal successors, (146), 25 states have internal predecessors, (146), 6 states have call successors, (105), 3 states have call predecessors, (105), 7 states have return successors, (107), 6 states have call predecessors, (107), 6 states have call successors, (107) [2025-03-17 03:18:06,435 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 265 transitions. [2025-03-17 03:18:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-17 03:18:06,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:18:06,437 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:18:06,444 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-17 03:18:06,637 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,SelfDestructingSolverStorable3 [2025-03-17 03:18:06,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:18:06,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:18:06,638 INFO L85 PathProgramCache]: Analyzing trace with hash 474330654, now seen corresponding path program 1 times [2025-03-17 03:18:06,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:18:06,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777074622] [2025-03-17 03:18:06,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:18:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:18:06,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-17 03:18:06,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-17 03:18:06,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:06,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:18:06,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129060428] [2025-03-17 03:18:06,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:18:06,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:18:06,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:18:06,888 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-17 03:18:06,891 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-17 03:18:06,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-17 03:18:07,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-17 03:18:07,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:18:07,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:18:07,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 03:18:07,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:18:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1222 proven. 477 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2025-03-17 03:18:14,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:18:25,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:18:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777074622] [2025-03-17 03:18:25,783 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 03:18:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129060428] [2025-03-17 03:18:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129060428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:18:25,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:18:25,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2025-03-17 03:18:25,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045089184] [2025-03-17 03:18:25,787 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 03:18:25,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 03:18:25,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:18:25,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 03:18:25,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=740, Unknown=3, NotChecked=0, Total=992 [2025-03-17 03:18:25,790 INFO L87 Difference]: Start difference. First operand 187 states and 265 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 23 states have internal predecessors, (89), 7 states have call successors, (37), 7 states have call predecessors, (37), 11 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) [2025-03-17 03:18:35,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:18:44,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:18:48,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:18:52,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:18:57,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:19:01,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:19:05,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:19:09,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:19:14,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:19:18,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:19:22,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:19:26,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:19:30,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 03:19:35,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]