./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_operatoramount_amount500_file-95.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 d09885049a0031727b27530c803aaab3d322c61ed8e044029287939cd57fd4df --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:38:12,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:38:12,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:38:12,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:38:12,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:38:12,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:38:12,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:38:12,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:38:12,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:38:12,970 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:38:12,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:38:12,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:38:12,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:38:12,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:38:12,972 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:38:12,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:38:12,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:38:12,972 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:38:12,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:38:12,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:38:12,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:38:12,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:38:12,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:38:12,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:38:12,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:38:12,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:38:12,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:38:12,973 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:38:12,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:38:12,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:38:12,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:38:12,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:38:12,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:38:12,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:38:12,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:38:12,974 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:38:12,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:38:12,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:38:12,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:38:12,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:38:12,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:38:12,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:38:12,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:38:12,975 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 -> d09885049a0031727b27530c803aaab3d322c61ed8e044029287939cd57fd4df [2025-03-04 00:38:13,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:38:13,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:38:13,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:38:13,196 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:38:13,197 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:38:13,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-95.i [2025-03-04 00:38:14,317 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dc5f326e/2c4029ca4c6742cd8490c7179c599a6f/FLAG0ca00e495 [2025-03-04 00:38:14,609 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:38:14,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-95.i [2025-03-04 00:38:14,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dc5f326e/2c4029ca4c6742cd8490c7179c599a6f/FLAG0ca00e495 [2025-03-04 00:38:14,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dc5f326e/2c4029ca4c6742cd8490c7179c599a6f [2025-03-04 00:38:14,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:38:14,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:38:14,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:38:14,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:38:14,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:38:14,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:38:14" (1/1) ... [2025-03-04 00:38:14,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c66e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:14, skipping insertion in model container [2025-03-04 00:38:14,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:38:14" (1/1) ... [2025-03-04 00:38:14,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:38:15,033 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_operatoramount_amount500_file-95.i[916,929] [2025-03-04 00:38:15,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:38:15,241 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:38:15,250 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_operatoramount_amount500_file-95.i[916,929] [2025-03-04 00:38:15,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:38:15,353 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:38:15,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15 WrapperNode [2025-03-04 00:38:15,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:38:15,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:38:15,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:38:15,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:38:15,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (1/1) ... [2025-03-04 00:38:15,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (1/1) ... [2025-03-04 00:38:15,447 INFO L138 Inliner]: procedures = 26, calls = 82, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 688 [2025-03-04 00:38:15,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:38:15,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:38:15,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:38:15,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:38:15,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (1/1) ... [2025-03-04 00:38:15,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (1/1) ... [2025-03-04 00:38:15,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (1/1) ... [2025-03-04 00:38:15,531 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-04 00:38:15,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (1/1) ... [2025-03-04 00:38:15,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (1/1) ... [2025-03-04 00:38:15,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (1/1) ... [2025-03-04 00:38:15,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (1/1) ... [2025-03-04 00:38:15,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (1/1) ... [2025-03-04 00:38:15,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (1/1) ... [2025-03-04 00:38:15,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:38:15,585 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:38:15,585 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:38:15,585 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:38:15,586 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (1/1) ... [2025-03-04 00:38:15,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:38:15,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:38:15,612 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-04 00:38:15,614 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-04 00:38:15,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:38:15,632 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:38:15,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:38:15,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:38:15,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:38:15,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:38:15,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:38:15,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:38:16,562 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L622: havoc property_#t~ite50#1;havoc property_#t~bitwise49#1;havoc property_#t~short51#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short54#1;havoc property_#t~ite57#1;havoc property_#t~bitwise55#1;havoc property_#t~bitwise56#1;havoc property_#t~short58#1;havoc property_#t~ite60#1;havoc property_#t~bitwise59#1;havoc property_#t~short61#1; [2025-03-04 00:38:16,671 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-03-04 00:38:16,671 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:38:16,715 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:38:16,715 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:38:16,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:38:16 BoogieIcfgContainer [2025-03-04 00:38:16,716 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:38:16,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:38:16,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:38:16,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:38:16,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:38:14" (1/3) ... [2025-03-04 00:38:16,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d70302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:38:16, skipping insertion in model container [2025-03-04 00:38:16,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:38:15" (2/3) ... [2025-03-04 00:38:16,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d70302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:38:16, skipping insertion in model container [2025-03-04 00:38:16,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:38:16" (3/3) ... [2025-03-04 00:38:16,722 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-95.i [2025-03-04 00:38:16,732 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:38:16,734 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-95.i that has 2 procedures, 282 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:38:16,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:38:16,791 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;@39a5bb02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:38:16,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:38:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 282 states, 210 states have (on average 1.5333333333333334) internal successors, (322), 211 states have internal predecessors, (322), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-04 00:38:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-04 00:38:16,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:16,812 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:16,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:16,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:16,816 INFO L85 PathProgramCache]: Analyzing trace with hash 193831879, now seen corresponding path program 1 times [2025-03-04 00:38:16,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:16,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662687741] [2025-03-04 00:38:16,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:16,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:16,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-04 00:38:16,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 00:38:16,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:16,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-03-04 00:38:17,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:17,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662687741] [2025-03-04 00:38:17,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662687741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:38:17,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375391686] [2025-03-04 00:38:17,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:17,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:38:17,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:38:17,316 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-04 00:38:17,318 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-04 00:38:17,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-04 00:38:17,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 00:38:17,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:17,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:17,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:38:17,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:38:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-03-04 00:38:17,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:38:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375391686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:17,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:38:17,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:38:17,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437894551] [2025-03-04 00:38:17,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:17,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:38:17,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:17,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:38:17,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:38:17,731 INFO L87 Difference]: Start difference. First operand has 282 states, 210 states have (on average 1.5333333333333334) internal successors, (322), 211 states have internal predecessors, (322), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-04 00:38:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:17,791 INFO L93 Difference]: Finished difference Result 558 states and 984 transitions. [2025-03-04 00:38:17,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:38:17,794 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) Word has length 477 [2025-03-04 00:38:17,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:17,803 INFO L225 Difference]: With dead ends: 558 [2025-03-04 00:38:17,804 INFO L226 Difference]: Without dead ends: 279 [2025-03-04 00:38:17,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 478 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-04 00:38:17,812 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:17,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:38:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-04 00:38:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-03-04 00:38:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 208 states have (on average 1.5240384615384615) internal successors, (317), 208 states have internal predecessors, (317), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-04 00:38:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 455 transitions. [2025-03-04 00:38:17,870 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 455 transitions. Word has length 477 [2025-03-04 00:38:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:17,871 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 455 transitions. [2025-03-04 00:38:17,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-04 00:38:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 455 transitions. [2025-03-04 00:38:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-04 00:38:17,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:17,879 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:17,887 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-04 00:38:18,083 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-04 00:38:18,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:18,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:18,084 INFO L85 PathProgramCache]: Analyzing trace with hash -412522672, now seen corresponding path program 1 times [2025-03-04 00:38:18,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:18,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502596821] [2025-03-04 00:38:18,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:18,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:18,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-04 00:38:18,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 00:38:18,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:18,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-04 00:38:18,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:18,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502596821] [2025-03-04 00:38:18,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502596821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:18,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:18,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:38:18,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047669643] [2025-03-04 00:38:18,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:18,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:38:18,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:18,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:38:18,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:38:18,553 INFO L87 Difference]: Start difference. First operand 279 states and 455 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:18,683 INFO L93 Difference]: Finished difference Result 828 states and 1353 transitions. [2025-03-04 00:38:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:38:18,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 477 [2025-03-04 00:38:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:18,691 INFO L225 Difference]: With dead ends: 828 [2025-03-04 00:38:18,691 INFO L226 Difference]: Without dead ends: 552 [2025-03-04 00:38:18,692 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-04 00:38:18,693 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 414 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:18,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1216 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:38:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-04 00:38:18,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 550. [2025-03-04 00:38:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 409 states have (on average 1.5134474327628362) internal successors, (619), 409 states have internal predecessors, (619), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-03-04 00:38:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 895 transitions. [2025-03-04 00:38:18,742 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 895 transitions. Word has length 477 [2025-03-04 00:38:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:18,744 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 895 transitions. [2025-03-04 00:38:18,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 895 transitions. [2025-03-04 00:38:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-04 00:38:18,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:18,749 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:18,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:38:18,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:18,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1368043951, now seen corresponding path program 1 times [2025-03-04 00:38:18,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:18,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79832721] [2025-03-04 00:38:18,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:18,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:18,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-04 00:38:18,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 00:38:18,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:18,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-04 00:38:19,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:19,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79832721] [2025-03-04 00:38:19,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79832721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:19,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:19,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:38:19,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431912411] [2025-03-04 00:38:19,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:19,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:38:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:19,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:38:19,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:38:19,085 INFO L87 Difference]: Start difference. First operand 550 states and 895 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:19,188 INFO L93 Difference]: Finished difference Result 1442 states and 2345 transitions. [2025-03-04 00:38:19,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:38:19,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 477 [2025-03-04 00:38:19,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:19,195 INFO L225 Difference]: With dead ends: 1442 [2025-03-04 00:38:19,195 INFO L226 Difference]: Without dead ends: 895 [2025-03-04 00:38:19,196 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-04 00:38:19,197 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 230 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:19,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 858 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:38:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-04 00:38:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 891. [2025-03-04 00:38:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 724 states have (on average 1.5469613259668509) internal successors, (1120), 726 states have internal predecessors, (1120), 162 states have call successors, (162), 4 states have call predecessors, (162), 4 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2025-03-04 00:38:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1444 transitions. [2025-03-04 00:38:19,259 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1444 transitions. Word has length 477 [2025-03-04 00:38:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:19,260 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1444 transitions. [2025-03-04 00:38:19,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1444 transitions. [2025-03-04 00:38:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-04 00:38:19,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:19,263 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:19,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:38:19,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:19,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:19,264 INFO L85 PathProgramCache]: Analyzing trace with hash 880733809, now seen corresponding path program 1 times [2025-03-04 00:38:19,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:19,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092965596] [2025-03-04 00:38:19,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:19,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:19,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-04 00:38:19,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 00:38:19,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:19,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-04 00:38:19,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092965596] [2025-03-04 00:38:19,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092965596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:19,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:19,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:38:19,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100441885] [2025-03-04 00:38:19,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:19,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:38:19,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:19,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:38:19,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:38:19,940 INFO L87 Difference]: Start difference. First operand 891 states and 1444 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:20,258 INFO L93 Difference]: Finished difference Result 2487 states and 4037 transitions. [2025-03-04 00:38:20,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:38:20,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 477 [2025-03-04 00:38:20,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:20,271 INFO L225 Difference]: With dead ends: 2487 [2025-03-04 00:38:20,272 INFO L226 Difference]: Without dead ends: 1599 [2025-03-04 00:38:20,274 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-04 00:38:20,276 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 351 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:20,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1315 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:38:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-03-04 00:38:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1012. [2025-03-04 00:38:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 774 states have (on average 1.5129198966408268) internal successors, (1171), 776 states have internal predecessors, (1171), 231 states have call successors, (231), 6 states have call predecessors, (231), 6 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-04 00:38:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1633 transitions. [2025-03-04 00:38:20,368 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1633 transitions. Word has length 477 [2025-03-04 00:38:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:20,369 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1633 transitions. [2025-03-04 00:38:20,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1633 transitions. [2025-03-04 00:38:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-04 00:38:20,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:20,373 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:20,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:38:20,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:20,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:20,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1582650716, now seen corresponding path program 1 times [2025-03-04 00:38:20,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:20,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764229549] [2025-03-04 00:38:20,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:20,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:20,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-04 00:38:20,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-04 00:38:20,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:20,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-04 00:38:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764229549] [2025-03-04 00:38:21,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764229549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:21,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:21,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:38:21,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434719028] [2025-03-04 00:38:21,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:21,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:38:21,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:21,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:38:21,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:38:21,016 INFO L87 Difference]: Start difference. First operand 1012 states and 1633 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:21,157 INFO L93 Difference]: Finished difference Result 2776 states and 4491 transitions. [2025-03-04 00:38:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:38:21,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 478 [2025-03-04 00:38:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:21,167 INFO L225 Difference]: With dead ends: 2776 [2025-03-04 00:38:21,167 INFO L226 Difference]: Without dead ends: 1888 [2025-03-04 00:38:21,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04 00:38:21,170 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 283 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:21,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 853 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:38:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2025-03-04 00:38:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1886. [2025-03-04 00:38:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1482 states have (on average 1.508097165991903) internal successors, (2235), 1486 states have internal predecessors, (2235), 393 states have call successors, (393), 10 states have call predecessors, (393), 10 states have return successors, (393), 389 states have call predecessors, (393), 393 states have call successors, (393) [2025-03-04 00:38:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 3021 transitions. [2025-03-04 00:38:21,268 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 3021 transitions. Word has length 478 [2025-03-04 00:38:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:21,268 INFO L471 AbstractCegarLoop]: Abstraction has 1886 states and 3021 transitions. [2025-03-04 00:38:21,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 3021 transitions. [2025-03-04 00:38:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-04 00:38:21,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:21,272 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:21,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:38:21,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:21,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash 149132570, now seen corresponding path program 1 times [2025-03-04 00:38:21,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:21,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688855701] [2025-03-04 00:38:21,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:21,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:21,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-04 00:38:21,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-04 00:38:21,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:21,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-04 00:38:22,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:22,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688855701] [2025-03-04 00:38:22,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688855701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:22,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:22,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:38:22,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827887093] [2025-03-04 00:38:22,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:22,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:38:22,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:22,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:38:22,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:38:22,248 INFO L87 Difference]: Start difference. First operand 1886 states and 3021 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:22,745 INFO L93 Difference]: Finished difference Result 6090 states and 9737 transitions. [2025-03-04 00:38:22,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:38:22,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 478 [2025-03-04 00:38:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:22,769 INFO L225 Difference]: With dead ends: 6090 [2025-03-04 00:38:22,770 INFO L226 Difference]: Without dead ends: 4328 [2025-03-04 00:38:22,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:38:22,776 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 858 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:22,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1409 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:38:22,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2025-03-04 00:38:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 3518. [2025-03-04 00:38:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3518 states, 2837 states have (on average 1.5178004934790272) internal successors, (4306), 2849 states have internal predecessors, (4306), 661 states have call successors, (661), 19 states have call predecessors, (661), 19 states have return successors, (661), 649 states have call predecessors, (661), 661 states have call successors, (661) [2025-03-04 00:38:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 3518 states and 5628 transitions. [2025-03-04 00:38:23,030 INFO L78 Accepts]: Start accepts. Automaton has 3518 states and 5628 transitions. Word has length 478 [2025-03-04 00:38:23,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:23,030 INFO L471 AbstractCegarLoop]: Abstraction has 3518 states and 5628 transitions. [2025-03-04 00:38:23,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3518 states and 5628 transitions. [2025-03-04 00:38:23,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-04 00:38:23,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:23,037 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:23,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:38:23,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:23,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:23,038 INFO L85 PathProgramCache]: Analyzing trace with hash 162665371, now seen corresponding path program 1 times [2025-03-04 00:38:23,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:23,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928863261] [2025-03-04 00:38:23,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:23,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:23,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-04 00:38:23,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-04 00:38:23,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:23,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-04 00:38:23,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:23,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928863261] [2025-03-04 00:38:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928863261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:23,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:23,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:38:23,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729323635] [2025-03-04 00:38:23,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:23,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:38:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:23,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:38:23,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:38:23,967 INFO L87 Difference]: Start difference. First operand 3518 states and 5628 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:24,522 INFO L93 Difference]: Finished difference Result 9667 states and 15544 transitions. [2025-03-04 00:38:24,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:38:24,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 478 [2025-03-04 00:38:24,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:24,550 INFO L225 Difference]: With dead ends: 9667 [2025-03-04 00:38:24,550 INFO L226 Difference]: Without dead ends: 6277 [2025-03-04 00:38:24,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:38:24,559 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 516 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:24,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1771 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:38:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6277 states. [2025-03-04 00:38:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6277 to 3523. [2025-03-04 00:38:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3523 states, 2842 states have (on average 1.5172413793103448) internal successors, (4312), 2854 states have internal predecessors, (4312), 661 states have call successors, (661), 19 states have call predecessors, (661), 19 states have return successors, (661), 649 states have call predecessors, (661), 661 states have call successors, (661) [2025-03-04 00:38:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 5634 transitions. [2025-03-04 00:38:24,830 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 5634 transitions. Word has length 478 [2025-03-04 00:38:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:24,832 INFO L471 AbstractCegarLoop]: Abstraction has 3523 states and 5634 transitions. [2025-03-04 00:38:24,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 5634 transitions. [2025-03-04 00:38:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-04 00:38:24,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:24,840 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:24,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:38:24,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:24,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1599527556, now seen corresponding path program 1 times [2025-03-04 00:38:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:24,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461870599] [2025-03-04 00:38:24,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:24,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:24,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-04 00:38:24,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-04 00:38:24,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:24,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-04 00:38:25,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:25,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461870599] [2025-03-04 00:38:25,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461870599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:25,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:25,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:38:25,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827492523] [2025-03-04 00:38:25,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:25,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:38:25,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:25,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:38:25,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:38:25,312 INFO L87 Difference]: Start difference. First operand 3523 states and 5634 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:25,777 INFO L93 Difference]: Finished difference Result 9227 states and 14794 transitions. [2025-03-04 00:38:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:38:25,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 478 [2025-03-04 00:38:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:25,802 INFO L225 Difference]: With dead ends: 9227 [2025-03-04 00:38:25,802 INFO L226 Difference]: Without dead ends: 5837 [2025-03-04 00:38:25,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:38:25,809 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 517 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:25,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1612 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:38:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5837 states. [2025-03-04 00:38:25,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5837 to 3525. [2025-03-04 00:38:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 2844 states have (on average 1.5168776371308017) internal successors, (4314), 2856 states have internal predecessors, (4314), 661 states have call successors, (661), 19 states have call predecessors, (661), 19 states have return successors, (661), 649 states have call predecessors, (661), 661 states have call successors, (661) [2025-03-04 00:38:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 5636 transitions. [2025-03-04 00:38:26,008 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 5636 transitions. Word has length 478 [2025-03-04 00:38:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:26,009 INFO L471 AbstractCegarLoop]: Abstraction has 3525 states and 5636 transitions. [2025-03-04 00:38:26,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 5636 transitions. [2025-03-04 00:38:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-04 00:38:26,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:26,015 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:26,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:38:26,016 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:26,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:26,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1210384189, now seen corresponding path program 1 times [2025-03-04 00:38:26,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:26,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752450267] [2025-03-04 00:38:26,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:26,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:26,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-04 00:38:26,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-04 00:38:26,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:26,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 78 proven. 126 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-03-04 00:38:27,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:27,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752450267] [2025-03-04 00:38:27,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752450267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:38:27,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030618451] [2025-03-04 00:38:27,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:27,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:38:27,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:38:27,239 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-04 00:38:27,240 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-04 00:38:27,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-04 00:38:27,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-04 00:38:27,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:27,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:27,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 00:38:27,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:38:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-04 00:38:27,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:38:27,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030618451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:27,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:38:27,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-04 00:38:27,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503082221] [2025-03-04 00:38:27,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:27,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:38:27,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:27,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:38:27,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:38:27,628 INFO L87 Difference]: Start difference. First operand 3525 states and 5636 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:27,933 INFO L93 Difference]: Finished difference Result 8193 states and 13122 transitions. [2025-03-04 00:38:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:38:27,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 478 [2025-03-04 00:38:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:27,966 INFO L225 Difference]: With dead ends: 8193 [2025-03-04 00:38:27,966 INFO L226 Difference]: Without dead ends: 4803 [2025-03-04 00:38:27,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:38:27,975 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 479 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:27,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1929 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:38:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2025-03-04 00:38:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4425. [2025-03-04 00:38:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4425 states, 3546 states have (on average 1.5076142131979695) internal successors, (5346), 3562 states have internal predecessors, (5346), 851 states have call successors, (851), 27 states have call predecessors, (851), 27 states have return successors, (851), 835 states have call predecessors, (851), 851 states have call successors, (851) [2025-03-04 00:38:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 4425 states and 7048 transitions. [2025-03-04 00:38:28,239 INFO L78 Accepts]: Start accepts. Automaton has 4425 states and 7048 transitions. Word has length 478 [2025-03-04 00:38:28,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:28,240 INFO L471 AbstractCegarLoop]: Abstraction has 4425 states and 7048 transitions. [2025-03-04 00:38:28,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 4425 states and 7048 transitions. [2025-03-04 00:38:28,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-04 00:38:28,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:28,247 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:28,255 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-04 00:38:28,447 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,SelfDestructingSolverStorable8 [2025-03-04 00:38:28,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:28,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:28,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1561184126, now seen corresponding path program 1 times [2025-03-04 00:38:28,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:28,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993019045] [2025-03-04 00:38:28,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:28,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:28,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-04 00:38:29,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-04 00:38:29,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:29,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:29,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 78 proven. 126 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-03-04 00:38:29,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:29,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993019045] [2025-03-04 00:38:29,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993019045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:38:29,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259825694] [2025-03-04 00:38:29,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:29,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:38:29,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:38:29,345 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-04 00:38:29,346 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-04 00:38:29,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-04 00:38:29,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-04 00:38:29,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:29,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:29,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:38:29,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:38:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 4604 proven. 120 refuted. 0 times theorem prover too weak. 4660 trivial. 0 not checked. [2025-03-04 00:38:29,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:38:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 84 proven. 120 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-03-04 00:38:30,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259825694] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:38:30,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:38:30,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-04 00:38:30,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411546358] [2025-03-04 00:38:30,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:38:30,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 00:38:30,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:30,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 00:38:30,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:38:30,302 INFO L87 Difference]: Start difference. First operand 4425 states and 7048 transitions. Second operand has 13 states, 13 states have (on average 22.076923076923077) internal successors, (287), 13 states have internal predecessors, (287), 6 states have call successors, (170), 2 states have call predecessors, (170), 4 states have return successors, (171), 6 states have call predecessors, (171), 6 states have call successors, (171) [2025-03-04 00:38:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:31,287 INFO L93 Difference]: Finished difference Result 8945 states and 14079 transitions. [2025-03-04 00:38:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:38:31,288 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 22.076923076923077) internal successors, (287), 13 states have internal predecessors, (287), 6 states have call successors, (170), 2 states have call predecessors, (170), 4 states have return successors, (171), 6 states have call predecessors, (171), 6 states have call successors, (171) Word has length 478 [2025-03-04 00:38:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:31,308 INFO L225 Difference]: With dead ends: 8945 [2025-03-04 00:38:31,309 INFO L226 Difference]: Without dead ends: 4655 [2025-03-04 00:38:31,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 952 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:38:31,321 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 1606 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:31,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 868 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:38:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2025-03-04 00:38:31,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 4601. [2025-03-04 00:38:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4601 states, 3678 states have (on average 1.478520935290919) internal successors, (5438), 3694 states have internal predecessors, (5438), 851 states have call successors, (851), 71 states have call predecessors, (851), 71 states have return successors, (851), 835 states have call predecessors, (851), 851 states have call successors, (851) [2025-03-04 00:38:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 7140 transitions. [2025-03-04 00:38:31,582 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 7140 transitions. Word has length 478 [2025-03-04 00:38:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:31,583 INFO L471 AbstractCegarLoop]: Abstraction has 4601 states and 7140 transitions. [2025-03-04 00:38:31,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 22.076923076923077) internal successors, (287), 13 states have internal predecessors, (287), 6 states have call successors, (170), 2 states have call predecessors, (170), 4 states have return successors, (171), 6 states have call predecessors, (171), 6 states have call successors, (171) [2025-03-04 00:38:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 7140 transitions. [2025-03-04 00:38:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-04 00:38:31,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:31,589 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:31,601 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-04 00:38:31,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:38:31,790 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:31,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:31,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1679281289, now seen corresponding path program 1 times [2025-03-04 00:38:31,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:31,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908828156] [2025-03-04 00:38:31,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:31,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:31,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-04 00:38:32,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-04 00:38:32,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:32,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 174 proven. 30 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-03-04 00:38:32,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:32,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908828156] [2025-03-04 00:38:32,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908828156] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:38:32,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750357923] [2025-03-04 00:38:32,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:32,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:38:32,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:38:32,961 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-04 00:38:32,963 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-04 00:38:33,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-04 00:38:33,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-04 00:38:33,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:33,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:33,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 1162 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:38:33,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:38:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 2504 proven. 30 refuted. 0 times theorem prover too weak. 6850 trivial. 0 not checked. [2025-03-04 00:38:33,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:38:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 174 proven. 30 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-03-04 00:38:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750357923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:38:33,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:38:33,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:38:33,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44034848] [2025-03-04 00:38:33,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:38:33,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:38:33,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:33,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:38:33,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:38:33,666 INFO L87 Difference]: Start difference. First operand 4601 states and 7140 transitions. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-04 00:38:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:34,237 INFO L93 Difference]: Finished difference Result 9159 states and 14164 transitions. [2025-03-04 00:38:34,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:38:34,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 480 [2025-03-04 00:38:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:34,252 INFO L225 Difference]: With dead ends: 9159 [2025-03-04 00:38:34,252 INFO L226 Difference]: Without dead ends: 4709 [2025-03-04 00:38:34,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 957 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:38:34,264 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 930 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:34,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 954 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:38:34,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2025-03-04 00:38:34,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 4637. [2025-03-04 00:38:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4637 states, 3705 states have (on average 1.4642375168690958) internal successors, (5425), 3721 states have internal predecessors, (5425), 851 states have call successors, (851), 80 states have call predecessors, (851), 80 states have return successors, (851), 835 states have call predecessors, (851), 851 states have call successors, (851) [2025-03-04 00:38:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4637 states to 4637 states and 7127 transitions. [2025-03-04 00:38:34,493 INFO L78 Accepts]: Start accepts. Automaton has 4637 states and 7127 transitions. Word has length 480 [2025-03-04 00:38:34,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:34,494 INFO L471 AbstractCegarLoop]: Abstraction has 4637 states and 7127 transitions. [2025-03-04 00:38:34,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-04 00:38:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4637 states and 7127 transitions. [2025-03-04 00:38:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-04 00:38:34,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:34,500 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:34,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:38:34,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:38:34,701 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:34,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:34,702 INFO L85 PathProgramCache]: Analyzing trace with hash -816153035, now seen corresponding path program 1 times [2025-03-04 00:38:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:34,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957596251] [2025-03-04 00:38:34,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:34,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:34,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-04 00:38:34,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-04 00:38:34,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:34,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-04 00:38:35,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:35,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957596251] [2025-03-04 00:38:35,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957596251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:35,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:35,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:38:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230779930] [2025-03-04 00:38:35,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:35,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:38:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:35,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:38:35,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:38:35,255 INFO L87 Difference]: Start difference. First operand 4637 states and 7127 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:35,814 INFO L93 Difference]: Finished difference Result 9289 states and 14245 transitions. [2025-03-04 00:38:35,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:38:35,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 480 [2025-03-04 00:38:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:35,829 INFO L225 Difference]: With dead ends: 9289 [2025-03-04 00:38:35,829 INFO L226 Difference]: Without dead ends: 4807 [2025-03-04 00:38:35,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-04 00:38:35,838 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 673 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:35,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 964 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:38:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2025-03-04 00:38:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4569. [2025-03-04 00:38:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4569 states, 3684 states have (on average 1.4614549402823018) internal successors, (5384), 3700 states have internal predecessors, (5384), 803 states have call successors, (803), 81 states have call predecessors, (803), 81 states have return successors, (803), 787 states have call predecessors, (803), 803 states have call successors, (803) [2025-03-04 00:38:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4569 states to 4569 states and 6990 transitions. [2025-03-04 00:38:36,171 INFO L78 Accepts]: Start accepts. Automaton has 4569 states and 6990 transitions. Word has length 480 [2025-03-04 00:38:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:36,171 INFO L471 AbstractCegarLoop]: Abstraction has 4569 states and 6990 transitions. [2025-03-04 00:38:36,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-04 00:38:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4569 states and 6990 transitions. [2025-03-04 00:38:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-04 00:38:36,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:36,177 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:36,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:38:36,177 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:36,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash -228595080, now seen corresponding path program 1 times [2025-03-04 00:38:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:36,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530932327] [2025-03-04 00:38:36,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:36,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-04 00:38:36,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-04 00:38:36,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:36,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat