./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-25.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_amount250_file-25.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 281e40e0c83f6d6e693e53d02625c3edf9f6f556e71b371176462fbb38feeeea --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:09:00,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:09:00,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:09:00,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:09:00,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:09:00,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:09:00,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:09:00,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:09:00,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:09:00,539 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:09:00,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:09:00,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:09:00,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:09:00,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:09:00,541 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:09:00,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:09:00,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:09:00,541 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:09:00,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:09:00,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:09:00,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:09:00,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:09:00,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:09:00,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:09:00,542 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:09:00,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:09:00,542 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:09:00,542 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:09:00,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:09:00,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:09:00,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:09:00,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:09:00,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:09:00,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:09:00,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:09:00,544 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:09:00,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:09:00,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:09:00,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:09:00,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:09:00,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:09:00,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:09:00,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:09:00,545 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 -> 281e40e0c83f6d6e693e53d02625c3edf9f6f556e71b371176462fbb38feeeea [2025-03-04 00:09:00,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:09:00,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:09:00,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:09:00,890 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:09:00,890 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:09:00,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-25.i [2025-03-04 00:09:02,846 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddb2abd2/b293a5ca35fd4ce190d5def2cd95c85e/FLAG0484e7bee [2025-03-04 00:09:03,430 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:09:03,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-25.i [2025-03-04 00:09:03,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddb2abd2/b293a5ca35fd4ce190d5def2cd95c85e/FLAG0484e7bee [2025-03-04 00:09:03,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddb2abd2/b293a5ca35fd4ce190d5def2cd95c85e [2025-03-04 00:09:03,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:09:03,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:09:03,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:09:03,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:09:03,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:09:03,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:03,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f28a534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:03, skipping insertion in model container [2025-03-04 00:09:03,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:09:03" (1/1) ... [2025-03-04 00:09:04,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:09:04,235 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_amount250_file-25.i[916,929] [2025-03-04 00:09:04,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:09:04,446 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:09:04,458 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_amount250_file-25.i[916,929] [2025-03-04 00:09:04,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:09:04,606 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:09:04,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:04 WrapperNode [2025-03-04 00:09:04,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:09:04,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:09:04,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:09:04,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:09:04,618 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:09:04" (1/1) ... [2025-03-04 00:09:04,650 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:09:04" (1/1) ... [2025-03-04 00:09:04,771 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2025-03-04 00:09:04,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:09:04,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:09:04,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:09:04,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:09:04,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:04" (1/1) ... [2025-03-04 00:09:04,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:04" (1/1) ... [2025-03-04 00:09:04,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:04" (1/1) ... [2025-03-04 00:09:04,829 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:09:04,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:04" (1/1) ... [2025-03-04 00:09:04,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:04" (1/1) ... [2025-03-04 00:09:04,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:04" (1/1) ... [2025-03-04 00:09:04,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:04" (1/1) ... [2025-03-04 00:09:04,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:04" (1/1) ... [2025-03-04 00:09:04,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:04" (1/1) ... [2025-03-04 00:09:04,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:09:04,875 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:09:04,876 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:09:04,876 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:09:04,877 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:04" (1/1) ... [2025-03-04 00:09:04,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:09:04,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:04,926 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:09:04,942 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:09:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:09:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:09:05,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:09:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:09:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:09:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:09:05,170 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:09:05,172 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:09:06,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L373: havoc property_#t~bitwise39#1;havoc property_#t~short40#1; [2025-03-04 00:09:06,311 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-04 00:09:06,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:09:06,336 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:09:06,337 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:09:06,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:09:06 BoogieIcfgContainer [2025-03-04 00:09:06,337 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:09:06,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:09:06,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:09:06,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:09:06,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:09:03" (1/3) ... [2025-03-04 00:09:06,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bf857e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:09:06, skipping insertion in model container [2025-03-04 00:09:06,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:04" (2/3) ... [2025-03-04 00:09:06,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bf857e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:09:06, skipping insertion in model container [2025-03-04 00:09:06,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:09:06" (3/3) ... [2025-03-04 00:09:06,348 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-25.i [2025-03-04 00:09:06,362 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:09:06,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-25.i that has 2 procedures, 165 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:09:06,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:09:06,464 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;@403e3d19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:09:06,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:09:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 108 states have (on average 1.462962962962963) internal successors, (158), 109 states have internal predecessors, (158), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 00:09:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-04 00:09:06,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:06,496 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:06,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:06,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:06,502 INFO L85 PathProgramCache]: Analyzing trace with hash -637262965, now seen corresponding path program 1 times [2025-03-04 00:09:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:06,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200291656] [2025-03-04 00:09:06,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:06,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:06,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-04 00:09:06,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-04 00:09:06,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:06,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2025-03-04 00:09:07,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:07,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200291656] [2025-03-04 00:09:07,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200291656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:07,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122599176] [2025-03-04 00:09:07,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:07,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:07,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:07,391 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:09:07,394 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:09:07,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-04 00:09:07,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-04 00:09:07,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:07,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:07,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:09:07,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2025-03-04 00:09:07,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:09:07,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122599176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:07,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:09:07,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:09:07,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106703413] [2025-03-04 00:09:07,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:07,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:09:07,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:07,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:09:07,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:09:07,918 INFO L87 Difference]: Start difference. First operand has 165 states, 108 states have (on average 1.462962962962963) internal successors, (158), 109 states have internal predecessors, (158), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-04 00:09:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:07,993 INFO L93 Difference]: Finished difference Result 324 states and 581 transitions. [2025-03-04 00:09:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:09:07,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) Word has length 347 [2025-03-04 00:09:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:08,003 INFO L225 Difference]: With dead ends: 324 [2025-03-04 00:09:08,004 INFO L226 Difference]: Without dead ends: 162 [2025-03-04 00:09:08,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 348 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:09:08,019 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:08,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:09:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-04 00:09:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-04 00:09:08,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 106 states have internal predecessors, (153), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 00:09:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 261 transitions. [2025-03-04 00:09:08,176 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 261 transitions. Word has length 347 [2025-03-04 00:09:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:08,178 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 261 transitions. [2025-03-04 00:09:08,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-04 00:09:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 261 transitions. [2025-03-04 00:09:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-04 00:09:08,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:08,193 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:08,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:09:08,394 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:09:08,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:08,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1216273519, now seen corresponding path program 1 times [2025-03-04 00:09:08,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:08,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833878466] [2025-03-04 00:09:08,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:08,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:08,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-04 00:09:08,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-04 00:09:08,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:08,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:09:08,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:08,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833878466] [2025-03-04 00:09:08,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833878466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:08,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:08,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:08,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450483508] [2025-03-04 00:09:08,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:08,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:08,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:08,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:08,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:08,883 INFO L87 Difference]: Start difference. First operand 162 states and 261 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:09:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:09,054 INFO L93 Difference]: Finished difference Result 469 states and 755 transitions. [2025-03-04 00:09:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:09,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 347 [2025-03-04 00:09:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:09,062 INFO L225 Difference]: With dead ends: 469 [2025-03-04 00:09:09,063 INFO L226 Difference]: Without dead ends: 310 [2025-03-04 00:09:09,065 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:09:09,068 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 240 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:09,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 632 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:09:09,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-04 00:09:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 185. [2025-03-04 00:09:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 129 states have (on average 1.441860465116279) internal successors, (186), 129 states have internal predecessors, (186), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 00:09:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 294 transitions. [2025-03-04 00:09:09,115 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 294 transitions. Word has length 347 [2025-03-04 00:09:09,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:09,121 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 294 transitions. [2025-03-04 00:09:09,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:09:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 294 transitions. [2025-03-04 00:09:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-04 00:09:09,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:09,126 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:09,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:09:09,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:09,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1159010286, now seen corresponding path program 1 times [2025-03-04 00:09:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:09,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983375673] [2025-03-04 00:09:09,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:09,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:09,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-04 00:09:09,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-04 00:09:09,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:09,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:09:09,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:09,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983375673] [2025-03-04 00:09:09,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983375673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:09,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:09,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:09:09,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896633809] [2025-03-04 00:09:09,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:09,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:09:09,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:09,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:09:09,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:09:09,913 INFO L87 Difference]: Start difference. First operand 185 states and 294 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:09:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:10,649 INFO L93 Difference]: Finished difference Result 650 states and 1025 transitions. [2025-03-04 00:09:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:09:10,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 347 [2025-03-04 00:09:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:10,657 INFO L225 Difference]: With dead ends: 650 [2025-03-04 00:09:10,658 INFO L226 Difference]: Without dead ends: 468 [2025-03-04 00:09:10,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:09:10,659 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 436 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:10,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1025 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:09:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-04 00:09:10,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 371. [2025-03-04 00:09:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 260 states have (on average 1.4307692307692308) internal successors, (372), 260 states have internal predecessors, (372), 108 states have call successors, (108), 2 states have call predecessors, (108), 2 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 00:09:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 588 transitions. [2025-03-04 00:09:10,721 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 588 transitions. Word has length 347 [2025-03-04 00:09:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:10,722 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 588 transitions. [2025-03-04 00:09:10,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:09:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 588 transitions. [2025-03-04 00:09:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-04 00:09:10,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:10,725 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:10,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:09:10,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:10,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash 66645647, now seen corresponding path program 1 times [2025-03-04 00:09:10,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:10,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211900807] [2025-03-04 00:09:10,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:10,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-04 00:09:10,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-04 00:09:10,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:10,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:09:11,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:11,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211900807] [2025-03-04 00:09:11,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211900807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:11,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:11,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:09:11,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692554831] [2025-03-04 00:09:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:11,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:09:11,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:11,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:09:11,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:11,193 INFO L87 Difference]: Start difference. First operand 371 states and 588 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:09:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:11,497 INFO L93 Difference]: Finished difference Result 954 states and 1510 transitions. [2025-03-04 00:09:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:09:11,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 347 [2025-03-04 00:09:11,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:11,503 INFO L225 Difference]: With dead ends: 954 [2025-03-04 00:09:11,503 INFO L226 Difference]: Without dead ends: 586 [2025-03-04 00:09:11,504 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:09:11,505 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 162 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:11,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 705 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:09:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-04 00:09:11,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 478. [2025-03-04 00:09:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 312 states have (on average 1.3814102564102564) internal successors, (431), 312 states have internal predecessors, (431), 162 states have call successors, (162), 3 states have call predecessors, (162), 3 states have return successors, (162), 162 states have call predecessors, (162), 162 states have call successors, (162) [2025-03-04 00:09:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 755 transitions. [2025-03-04 00:09:11,587 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 755 transitions. Word has length 347 [2025-03-04 00:09:11,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:11,588 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 755 transitions. [2025-03-04 00:09:11,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:09:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 755 transitions. [2025-03-04 00:09:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-04 00:09:11,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:11,592 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:11,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:09:11,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:11,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:11,593 INFO L85 PathProgramCache]: Analyzing trace with hash 936217321, now seen corresponding path program 1 times [2025-03-04 00:09:11,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:11,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303437335] [2025-03-04 00:09:11,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:11,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:11,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-04 00:09:12,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-04 00:09:12,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:12,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:09:12,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303437335] [2025-03-04 00:09:12,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303437335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662947519] [2025-03-04 00:09:12,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:12,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:12,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:12,817 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:09:12,819 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:09:12,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-04 00:09:13,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-04 00:09:13,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:13,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:13,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 00:09:13,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2895 proven. 333 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2025-03-04 00:09:16,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 126 proven. 342 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2025-03-04 00:09:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662947519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:21,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:21,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 30 [2025-03-04 00:09:21,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613472985] [2025-03-04 00:09:21,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:21,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 00:09:21,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:21,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 00:09:21,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2025-03-04 00:09:21,265 INFO L87 Difference]: Start difference. First operand 478 states and 755 transitions. Second operand has 30 states, 29 states have (on average 7.482758620689655) internal successors, (217), 28 states have internal predecessors, (217), 10 states have call successors, (162), 5 states have call predecessors, (162), 11 states have return successors, (162), 9 states have call predecessors, (162), 10 states have call successors, (162) [2025-03-04 00:09:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:35,815 INFO L93 Difference]: Finished difference Result 2012 states and 3054 transitions. [2025-03-04 00:09:35,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-04 00:09:35,818 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 7.482758620689655) internal successors, (217), 28 states have internal predecessors, (217), 10 states have call successors, (162), 5 states have call predecessors, (162), 11 states have return successors, (162), 9 states have call predecessors, (162), 10 states have call successors, (162) Word has length 348 [2025-03-04 00:09:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:35,841 INFO L225 Difference]: With dead ends: 2012 [2025-03-04 00:09:35,842 INFO L226 Difference]: Without dead ends: 1636 [2025-03-04 00:09:35,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 688 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5070 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2454, Invalid=11826, Unknown=0, NotChecked=0, Total=14280 [2025-03-04 00:09:35,853 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 4320 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 1242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 3838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1242 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:35,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4321 Valid, 1959 Invalid, 3838 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1242 Valid, 2596 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-03-04 00:09:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2025-03-04 00:09:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1062. [2025-03-04 00:09:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 761 states have (on average 1.363994743758213) internal successors, (1038), 763 states have internal predecessors, (1038), 274 states have call successors, (274), 26 states have call predecessors, (274), 26 states have return successors, (274), 272 states have call predecessors, (274), 274 states have call successors, (274) [2025-03-04 00:09:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1586 transitions. [2025-03-04 00:09:36,236 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1586 transitions. Word has length 348 [2025-03-04 00:09:36,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:36,237 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1586 transitions. [2025-03-04 00:09:36,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 7.482758620689655) internal successors, (217), 28 states have internal predecessors, (217), 10 states have call successors, (162), 5 states have call predecessors, (162), 11 states have return successors, (162), 9 states have call predecessors, (162), 10 states have call successors, (162) [2025-03-04 00:09:36,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1586 transitions. [2025-03-04 00:09:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-04 00:09:36,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:36,242 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:36,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:09:36,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:36,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:36,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:36,444 INFO L85 PathProgramCache]: Analyzing trace with hash 266562391, now seen corresponding path program 1 times [2025-03-04 00:09:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:36,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508478534] [2025-03-04 00:09:36,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:36,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:36,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 00:09:37,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 00:09:37,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:37,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 63 proven. 96 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:09:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508478534] [2025-03-04 00:09:40,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508478534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880198728] [2025-03-04 00:09:40,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:40,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:40,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:40,054 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:09:40,082 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:09:40,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 00:09:40,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 00:09:40,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:40,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:40,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 00:09:40,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2817 proven. 186 refuted. 0 times theorem prover too weak. 2721 trivial. 0 not checked. [2025-03-04 00:09:43,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 126 proven. 189 refuted. 0 times theorem prover too weak. 5409 trivial. 0 not checked. [2025-03-04 00:09:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880198728] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:49,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:49,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 16] total 37 [2025-03-04 00:09:49,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124427335] [2025-03-04 00:09:49,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:49,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 00:09:49,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:49,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 00:09:49,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 00:09:49,580 INFO L87 Difference]: Start difference. First operand 1062 states and 1586 transitions. Second operand has 37 states, 36 states have (on average 6.666666666666667) internal successors, (240), 35 states have internal predecessors, (240), 8 states have call successors, (162), 4 states have call predecessors, (162), 8 states have return successors, (162), 8 states have call predecessors, (162), 8 states have call successors, (162) [2025-03-04 00:10:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:23,643 INFO L93 Difference]: Finished difference Result 4104 states and 6089 transitions. [2025-03-04 00:10:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-04 00:10:23,644 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 6.666666666666667) internal successors, (240), 35 states have internal predecessors, (240), 8 states have call successors, (162), 4 states have call predecessors, (162), 8 states have return successors, (162), 8 states have call predecessors, (162), 8 states have call successors, (162) Word has length 350 [2025-03-04 00:10:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:23,660 INFO L225 Difference]: With dead ends: 4104 [2025-03-04 00:10:23,660 INFO L226 Difference]: Without dead ends: 3214 [2025-03-04 00:10:23,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4134 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=2249, Invalid=11323, Unknown=0, NotChecked=0, Total=13572 [2025-03-04 00:10:23,668 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 4582 mSDsluCounter, 3350 mSDsCounter, 0 mSdLazyCounter, 5336 mSolverCounterSat, 2571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4583 SdHoareTripleChecker+Valid, 3643 SdHoareTripleChecker+Invalid, 7907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2571 IncrementalHoareTripleChecker+Valid, 5336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:23,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4583 Valid, 3643 Invalid, 7907 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2571 Valid, 5336 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2025-03-04 00:10:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2025-03-04 00:10:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 1993. [2025-03-04 00:10:24,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1374 states have (on average 1.3245997088791848) internal successors, (1820), 1380 states have internal predecessors, (1820), 565 states have call successors, (565), 53 states have call predecessors, (565), 53 states have return successors, (565), 559 states have call predecessors, (565), 565 states have call successors, (565) [2025-03-04 00:10:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2950 transitions. [2025-03-04 00:10:24,175 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2950 transitions. Word has length 350 [2025-03-04 00:10:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:24,176 INFO L471 AbstractCegarLoop]: Abstraction has 1993 states and 2950 transitions. [2025-03-04 00:10:24,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 6.666666666666667) internal successors, (240), 35 states have internal predecessors, (240), 8 states have call successors, (162), 4 states have call predecessors, (162), 8 states have return successors, (162), 8 states have call predecessors, (162), 8 states have call successors, (162) [2025-03-04 00:10:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2950 transitions. [2025-03-04 00:10:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-04 00:10:24,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:24,178 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:24,187 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:10:24,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:24,383 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:24,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:24,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1217923865, now seen corresponding path program 1 times [2025-03-04 00:10:24,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:24,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974708117] [2025-03-04 00:10:24,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:24,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:24,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 00:10:24,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 00:10:24,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:24,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:10:24,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:24,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974708117] [2025-03-04 00:10:24,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974708117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:24,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:24,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:10:24,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415599033] [2025-03-04 00:10:24,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:24,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:10:24,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:24,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:10:24,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:10:24,705 INFO L87 Difference]: Start difference. First operand 1993 states and 2950 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:10:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:25,350 INFO L93 Difference]: Finished difference Result 3349 states and 4905 transitions. [2025-03-04 00:10:25,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:10:25,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 350 [2025-03-04 00:10:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:25,359 INFO L225 Difference]: With dead ends: 3349 [2025-03-04 00:10:25,360 INFO L226 Difference]: Without dead ends: 1695 [2025-03-04 00:10:25,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:10:25,365 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 249 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:25,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 783 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:10:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-03-04 00:10:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1194. [2025-03-04 00:10:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 841 states have (on average 1.3174791914387634) internal successors, (1108), 844 states have internal predecessors, (1108), 315 states have call successors, (315), 37 states have call predecessors, (315), 37 states have return successors, (315), 312 states have call predecessors, (315), 315 states have call successors, (315) [2025-03-04 00:10:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1738 transitions. [2025-03-04 00:10:25,607 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1738 transitions. Word has length 350 [2025-03-04 00:10:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:25,608 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1738 transitions. [2025-03-04 00:10:25,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:10:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1738 transitions. [2025-03-04 00:10:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-04 00:10:25,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:25,611 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:25,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:10:25,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:25,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:25,612 INFO L85 PathProgramCache]: Analyzing trace with hash 408572889, now seen corresponding path program 1 times [2025-03-04 00:10:25,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:25,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662642466] [2025-03-04 00:10:25,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:25,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:25,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 00:10:25,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 00:10:25,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:25,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 69 proven. 90 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:10:26,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:26,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662642466] [2025-03-04 00:10:26,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662642466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:26,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741932765] [2025-03-04 00:10:26,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:26,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:26,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:26,256 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:10:26,257 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:10:26,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-04 00:10:26,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-04 00:10:26,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:26,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:26,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:10:26,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2859 proven. 90 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2025-03-04 00:10:27,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:27,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 69 proven. 90 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:10:27,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741932765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:27,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:27,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 16 [2025-03-04 00:10:27,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159110210] [2025-03-04 00:10:27,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:27,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:10:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:27,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:10:27,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:10:27,995 INFO L87 Difference]: Start difference. First operand 1194 states and 1738 transitions. Second operand has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 5 states have call successors, (138), 3 states have call predecessors, (138), 6 states have return successors, (139), 5 states have call predecessors, (139), 5 states have call successors, (139) [2025-03-04 00:10:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:29,251 INFO L93 Difference]: Finished difference Result 2124 states and 3053 transitions. [2025-03-04 00:10:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 00:10:29,252 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 5 states have call successors, (138), 3 states have call predecessors, (138), 6 states have return successors, (139), 5 states have call predecessors, (139), 5 states have call successors, (139) Word has length 350 [2025-03-04 00:10:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:29,257 INFO L225 Difference]: With dead ends: 2124 [2025-03-04 00:10:29,258 INFO L226 Difference]: Without dead ends: 1078 [2025-03-04 00:10:29,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 691 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-03-04 00:10:29,260 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 1056 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:29,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 929 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:10:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-03-04 00:10:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1055. [2025-03-04 00:10:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 697 states have (on average 1.2352941176470589) internal successors, (861), 700 states have internal predecessors, (861), 315 states have call successors, (315), 42 states have call predecessors, (315), 42 states have return successors, (315), 312 states have call predecessors, (315), 315 states have call successors, (315) [2025-03-04 00:10:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1491 transitions. [2025-03-04 00:10:29,488 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1491 transitions. Word has length 350 [2025-03-04 00:10:29,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:29,488 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1491 transitions. [2025-03-04 00:10:29,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 5 states have call successors, (138), 3 states have call predecessors, (138), 6 states have return successors, (139), 5 states have call predecessors, (139), 5 states have call successors, (139) [2025-03-04 00:10:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1491 transitions. [2025-03-04 00:10:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-04 00:10:29,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:29,490 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:29,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:10:29,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:29,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:29,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash -962102944, now seen corresponding path program 1 times [2025-03-04 00:10:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:29,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498903845] [2025-03-04 00:10:29,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:29,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:29,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-04 00:10:30,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-04 00:10:30,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:30,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 108 proven. 204 refuted. 0 times theorem prover too weak. 5412 trivial. 0 not checked. [2025-03-04 00:10:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498903845] [2025-03-04 00:10:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498903845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858935573] [2025-03-04 00:10:30,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:30,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:30,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:30,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:10:30,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:10:30,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-04 00:10:30,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-04 00:10:30,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:30,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:30,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 00:10:30,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 3140 proven. 405 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2025-03-04 00:10:33,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 63 proven. 96 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:10:33,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858935573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:33,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:33,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 8] total 26 [2025-03-04 00:10:33,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987903921] [2025-03-04 00:10:33,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:33,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 00:10:33,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:33,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 00:10:33,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2025-03-04 00:10:33,962 INFO L87 Difference]: Start difference. First operand 1055 states and 1491 transitions. Second operand has 26 states, 26 states have (on average 8.5) internal successors, (221), 25 states have internal predecessors, (221), 8 states have call successors, (132), 5 states have call predecessors, (132), 9 states have return successors, (134), 8 states have call predecessors, (134), 8 states have call successors, (134)