./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.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 aa1b7e3020c9e54f93d45078f4a249ca3b737cc17c725ce83b71e2a4a5a42766 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:49:32,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:49:32,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:49:32,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:49:32,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:49:32,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:49:32,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:49:32,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:49:32,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:49:32,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:49:32,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:49:32,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:49:32,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:49:32,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:49:32,669 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:49:32,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:49:32,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:49:32,669 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:49:32,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:49:32,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:49:32,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:49:32,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:49:32,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:49:32,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:49:32,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:49:32,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:49:32,670 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:49:32,670 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:49:32,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:49:32,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:49:32,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:49:32,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:49:32,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:49:32,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:49:32,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:49:32,670 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:49:32,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:49:32,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:49:32,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:49:32,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:49:32,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:49:32,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:49:32,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:49:32,672 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 -> aa1b7e3020c9e54f93d45078f4a249ca3b737cc17c725ce83b71e2a4a5a42766 [2025-03-17 03:49:32,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:49:32,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:49:32,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:49:32,927 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:49:32,927 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:49:32,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i [2025-03-17 03:49:34,104 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edadc7e1/6b0c585a9d0149d2b31b2b71318e2346/FLAGe85e39a94 [2025-03-17 03:49:34,338 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:49:34,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i [2025-03-17 03:49:34,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edadc7e1/6b0c585a9d0149d2b31b2b71318e2346/FLAGe85e39a94 [2025-03-17 03:49:34,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edadc7e1/6b0c585a9d0149d2b31b2b71318e2346 [2025-03-17 03:49:34,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:49:34,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:49:34,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:49:34,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:49:34,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:49:34,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:34,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5edcf66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34, skipping insertion in model container [2025-03-17 03:49:34,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:34,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:49:34,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i[915,928] [2025-03-17 03:49:34,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:49:34,868 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:49:34,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i[915,928] [2025-03-17 03:49:34,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:49:34,925 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:49:34,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34 WrapperNode [2025-03-17 03:49:34,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:49:34,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:49:34,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:49:34,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:49:34,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:34,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:34,969 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2025-03-17 03:49:34,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:49:34,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:49:34,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:49:34,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:49:34,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:34,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:34,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:34,997 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:49:34,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:34,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:35,002 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:35,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:35,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:35,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:35,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:49:35,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:49:35,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:49:35,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:49:35,009 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (1/1) ... [2025-03-17 03:49:35,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:49:35,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:49:35,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:49:35,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:49:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:49:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:49:35,065 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:49:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:49:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:49:35,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:49:35,127 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:49:35,128 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:49:35,444 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~bitwise13#1;havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2025-03-17 03:49:35,471 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-17 03:49:35,472 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:49:35,494 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:49:35,495 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:49:35,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:49:35 BoogieIcfgContainer [2025-03-17 03:49:35,496 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:49:35,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:49:35,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:49:35,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:49:35,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:49:34" (1/3) ... [2025-03-17 03:49:35,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56720012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:49:35, skipping insertion in model container [2025-03-17 03:49:35,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:34" (2/3) ... [2025-03-17 03:49:35,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56720012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:49:35, skipping insertion in model container [2025-03-17 03:49:35,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:49:35" (3/3) ... [2025-03-17 03:49:35,505 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-34.i [2025-03-17 03:49:35,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:49:35,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-34.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:49:35,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:49:35,592 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;@52cf5296, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:49:35,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:49:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 03:49:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 03:49:35,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:49:35,605 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:49:35,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:49:35,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:49:35,610 INFO L85 PathProgramCache]: Analyzing trace with hash -877579791, now seen corresponding path program 1 times [2025-03-17 03:49:35,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:49:35,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526160511] [2025-03-17 03:49:35,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:49:35,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:49:35,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 03:49:35,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 03:49:35,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:49:35,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:49:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 03:49:35,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:49:35,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526160511] [2025-03-17 03:49:35,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526160511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:49:35,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576376539] [2025-03-17 03:49:35,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:49:35,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:49:35,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:49:35,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:49:35,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:49:35,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 03:49:35,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 03:49:35,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:49:35,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:49:35,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:49:35,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:49:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 03:49:36,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:49:36,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576376539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:49:36,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:49:36,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:49:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817673955] [2025-03-17 03:49:36,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:49:36,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:49:36,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:49:36,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:49:36,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:49:36,033 INFO L87 Difference]: Start difference. First operand has 66 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:49:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:49:36,060 INFO L93 Difference]: Finished difference Result 131 states and 216 transitions. [2025-03-17 03:49:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:49:36,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2025-03-17 03:49:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:49:36,070 INFO L225 Difference]: With dead ends: 131 [2025-03-17 03:49:36,073 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 03:49:36,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:49:36,081 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:49:36,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:49:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 03:49:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 03:49:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.469387755102041) internal successors, (72), 49 states have internal predecessors, (72), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 03:49:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2025-03-17 03:49:36,110 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 91 [2025-03-17 03:49:36,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:49:36,110 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2025-03-17 03:49:36,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:49:36,111 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2025-03-17 03:49:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 03:49:36,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:49:36,113 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:49:36,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:49:36,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:49:36,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:49:36,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:49:36,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1206038322, now seen corresponding path program 1 times [2025-03-17 03:49:36,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:49:36,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414510489] [2025-03-17 03:49:36,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:49:36,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:49:36,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 03:49:36,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 03:49:36,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:49:36,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:49:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 03:49:36,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:49:36,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414510489] [2025-03-17 03:49:36,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414510489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:49:36,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:49:36,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:49:36,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465188164] [2025-03-17 03:49:36,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:49:36,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:49:36,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:49:36,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:49:36,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:49:36,708 INFO L87 Difference]: Start difference. First operand 64 states and 98 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:49:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:49:36,819 INFO L93 Difference]: Finished difference Result 220 states and 337 transitions. [2025-03-17 03:49:36,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:49:36,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-17 03:49:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:49:36,823 INFO L225 Difference]: With dead ends: 220 [2025-03-17 03:49:36,823 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 03:49:36,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:49:36,825 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 126 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:49:36,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 302 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:49:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 03:49:36,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 127. [2025-03-17 03:49:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 98 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 03:49:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 195 transitions. [2025-03-17 03:49:36,844 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 195 transitions. Word has length 91 [2025-03-17 03:49:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:49:36,845 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 195 transitions. [2025-03-17 03:49:36,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:49:36,845 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 195 transitions. [2025-03-17 03:49:36,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 03:49:36,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:49:36,846 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:49:36,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:49:36,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:49:36,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:49:36,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1830948759, now seen corresponding path program 1 times [2025-03-17 03:49:36,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:49:36,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871092437] [2025-03-17 03:49:36,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:49:36,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:49:36,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 03:49:36,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 03:49:36,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:49:36,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:49:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 03:49:36,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:49:36,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871092437] [2025-03-17 03:49:36,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871092437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:49:36,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:49:36,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:49:36,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337522300] [2025-03-17 03:49:36,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:49:36,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:49:36,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:49:36,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:49:36,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:49:36,996 INFO L87 Difference]: Start difference. First operand 127 states and 195 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:49:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:49:37,193 INFO L93 Difference]: Finished difference Result 374 states and 572 transitions. [2025-03-17 03:49:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:49:37,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-03-17 03:49:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:49:37,195 INFO L225 Difference]: With dead ends: 374 [2025-03-17 03:49:37,197 INFO L226 Difference]: Without dead ends: 248 [2025-03-17 03:49:37,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:49:37,198 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 131 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:49:37,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 373 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:49:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-17 03:49:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 131. [2025-03-17 03:49:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 102 states have internal predecessors, (147), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 03:49:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2025-03-17 03:49:37,215 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 92 [2025-03-17 03:49:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:49:37,215 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2025-03-17 03:49:37,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:49:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2025-03-17 03:49:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 03:49:37,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:49:37,216 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:49:37,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:49:37,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:49:37,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:49:37,217 INFO L85 PathProgramCache]: Analyzing trace with hash -862702033, now seen corresponding path program 1 times [2025-03-17 03:49:37,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:49:37,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435532704] [2025-03-17 03:49:37,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:49:37,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:49:37,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 03:49:37,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 03:49:37,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:49:37,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:49:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 03:49:39,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:49:39,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435532704] [2025-03-17 03:49:39,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435532704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:49:39,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:49:39,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:49:39,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895488462] [2025-03-17 03:49:39,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:49:39,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:49:39,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:49:39,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:49:39,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:49:39,606 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:49:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:49:40,093 INFO L93 Difference]: Finished difference Result 421 states and 633 transitions. [2025-03-17 03:49:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:49:40,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2025-03-17 03:49:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:49:40,095 INFO L225 Difference]: With dead ends: 421 [2025-03-17 03:49:40,095 INFO L226 Difference]: Without dead ends: 291 [2025-03-17 03:49:40,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:49:40,096 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 168 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:49:40,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 304 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:49:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-17 03:49:40,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2025-03-17 03:49:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 134 states have internal predecessors, (191), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 03:49:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 269 transitions. [2025-03-17 03:49:40,121 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 269 transitions. Word has length 93 [2025-03-17 03:49:40,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:49:40,121 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 269 transitions. [2025-03-17 03:49:40,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:49:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 269 transitions. [2025-03-17 03:49:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 03:49:40,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:49:40,126 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:49:40,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:49:40,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:49:40,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:49:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1882690570, now seen corresponding path program 1 times [2025-03-17 03:49:40,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:49:40,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499037827] [2025-03-17 03:49:40,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:49:40,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:49:40,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 03:49:40,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 03:49:40,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:49:40,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:49:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 03:49:47,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:49:47,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499037827] [2025-03-17 03:49:47,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499037827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:49:47,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:49:47,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:49:47,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850611960] [2025-03-17 03:49:47,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:49:47,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:49:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:49:47,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:49:47,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:49:47,545 INFO L87 Difference]: Start difference. First operand 177 states and 269 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:49:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:49:50,141 INFO L93 Difference]: Finished difference Result 629 states and 920 transitions. [2025-03-17 03:49:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 03:49:50,142 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2025-03-17 03:49:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:49:50,145 INFO L225 Difference]: With dead ends: 629 [2025-03-17 03:49:50,145 INFO L226 Difference]: Without dead ends: 482 [2025-03-17 03:49:50,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-03-17 03:49:50,147 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 556 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:49:50,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 578 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 03:49:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-17 03:49:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 266. [2025-03-17 03:49:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 223 states have (on average 1.4260089686098654) internal successors, (318), 223 states have internal predecessors, (318), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 03:49:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 396 transitions. [2025-03-17 03:49:50,183 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 396 transitions. Word has length 93 [2025-03-17 03:49:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:49:50,184 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 396 transitions. [2025-03-17 03:49:50,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:49:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 396 transitions. [2025-03-17 03:49:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 03:49:50,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:49:50,187 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:49:50,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:49:50,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:49:50,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:49:50,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1524773045, now seen corresponding path program 1 times [2025-03-17 03:49:50,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:49:50,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686178853] [2025-03-17 03:49:50,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:49:50,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:49:50,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 03:49:50,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 03:49:50,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:49:50,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:49:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 03:49:51,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:49:51,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686178853] [2025-03-17 03:49:51,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686178853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:49:51,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:49:51,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:49:51,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094588556] [2025-03-17 03:49:51,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:49:51,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:49:51,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:49:51,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:49:51,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:49:51,680 INFO L87 Difference]: Start difference. First operand 266 states and 396 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:49:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:49:52,633 INFO L93 Difference]: Finished difference Result 623 states and 930 transitions. [2025-03-17 03:49:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:49:52,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2025-03-17 03:49:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:49:52,637 INFO L225 Difference]: With dead ends: 623 [2025-03-17 03:49:52,637 INFO L226 Difference]: Without dead ends: 477 [2025-03-17 03:49:52,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:49:52,638 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 373 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:49:52,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 361 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:49:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-17 03:49:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 311. [2025-03-17 03:49:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 268 states have (on average 1.4067164179104477) internal successors, (377), 268 states have internal predecessors, (377), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 03:49:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 455 transitions. [2025-03-17 03:49:52,665 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 455 transitions. Word has length 93 [2025-03-17 03:49:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:49:52,666 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 455 transitions. [2025-03-17 03:49:52,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:49:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 455 transitions. [2025-03-17 03:49:52,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 03:49:52,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:49:52,668 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:49:52,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:49:52,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:49:52,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:49:52,669 INFO L85 PathProgramCache]: Analyzing trace with hash 75236107, now seen corresponding path program 1 times [2025-03-17 03:49:52,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:49:52,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101331794] [2025-03-17 03:49:52,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:49:52,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:49:52,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 03:49:52,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 03:49:52,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:49:52,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:49:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 03:49:54,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:49:54,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101331794] [2025-03-17 03:49:54,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101331794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:49:54,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:49:54,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:49:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618002104] [2025-03-17 03:49:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:49:54,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:49:54,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:49:54,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:49:54,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:49:54,268 INFO L87 Difference]: Start difference. First operand 311 states and 455 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:49:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:49:55,148 INFO L93 Difference]: Finished difference Result 613 states and 895 transitions. [2025-03-17 03:49:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:49:55,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 93 [2025-03-17 03:49:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:49:55,152 INFO L225 Difference]: With dead ends: 613 [2025-03-17 03:49:55,152 INFO L226 Difference]: Without dead ends: 469 [2025-03-17 03:49:55,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-17 03:49:55,155 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 308 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:49:55,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 474 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:49:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-17 03:49:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 367. [2025-03-17 03:49:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 324 states have (on average 1.441358024691358) internal successors, (467), 324 states have internal predecessors, (467), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 03:49:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 545 transitions. [2025-03-17 03:49:55,194 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 545 transitions. Word has length 93 [2025-03-17 03:49:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:49:55,194 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 545 transitions. [2025-03-17 03:49:55,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:49:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 545 transitions. [2025-03-17 03:49:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 03:49:55,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:49:55,198 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:49:55,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:49:55,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:49:55,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:49:55,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1368260658, now seen corresponding path program 1 times [2025-03-17 03:49:55,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:49:55,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360350467] [2025-03-17 03:49:55,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:49:55,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:49:55,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 03:49:55,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 03:49:55,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:49:55,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:49:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 03:49:55,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:49:55,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360350467] [2025-03-17 03:49:55,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360350467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:49:55,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:49:55,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:49:55,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122585911] [2025-03-17 03:49:55,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:49:55,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:49:55,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:49:55,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:49:55,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:49:55,432 INFO L87 Difference]: Start difference. First operand 367 states and 545 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:49:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:49:55,635 INFO L93 Difference]: Finished difference Result 581 states and 866 transitions. [2025-03-17 03:49:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:49:55,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2025-03-17 03:49:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:49:55,640 INFO L225 Difference]: With dead ends: 581 [2025-03-17 03:49:55,640 INFO L226 Difference]: Without dead ends: 357 [2025-03-17 03:49:55,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:49:55,642 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 78 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:49:55,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 223 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:49:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-17 03:49:55,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 329. [2025-03-17 03:49:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 286 states have (on average 1.402097902097902) internal successors, (401), 286 states have internal predecessors, (401), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 03:49:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 479 transitions. [2025-03-17 03:49:55,671 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 479 transitions. Word has length 93 [2025-03-17 03:49:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:49:55,673 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 479 transitions. [2025-03-17 03:49:55,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:49:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 479 transitions. [2025-03-17 03:49:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 03:49:55,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:49:55,675 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:49:55,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:49:55,676 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:49:55,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:49:55,676 INFO L85 PathProgramCache]: Analyzing trace with hash -885469953, now seen corresponding path program 1 times [2025-03-17 03:49:55,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:49:55,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038577699] [2025-03-17 03:49:55,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:49:55,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:49:55,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:49:55,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:49:55,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:49:55,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:50:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 03:50:25,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:50:25,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038577699] [2025-03-17 03:50:25,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038577699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:50:25,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:50:25,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 03:50:25,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391348711] [2025-03-17 03:50:25,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:50:25,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 03:50:25,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:50:25,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 03:50:25,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-17 03:50:25,845 INFO L87 Difference]: Start difference. First operand 329 states and 479 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:50:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:50:27,922 INFO L93 Difference]: Finished difference Result 704 states and 1011 transitions. [2025-03-17 03:50:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 03:50:27,922 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-03-17 03:50:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:50:27,925 INFO L225 Difference]: With dead ends: 704 [2025-03-17 03:50:27,925 INFO L226 Difference]: Without dead ends: 514 [2025-03-17 03:50:27,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2025-03-17 03:50:27,929 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 374 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:50:27,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 717 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 03:50:27,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-17 03:50:27,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 359. [2025-03-17 03:50:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 316 states have (on average 1.3987341772151898) internal successors, (442), 316 states have internal predecessors, (442), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 03:50:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 520 transitions. [2025-03-17 03:50:27,960 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 520 transitions. Word has length 94 [2025-03-17 03:50:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:50:27,961 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 520 transitions. [2025-03-17 03:50:27,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 03:50:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 520 transitions. [2025-03-17 03:50:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 03:50:27,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:50:27,962 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:50:27,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 03:50:27,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:50:27,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:50:27,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1602042880, now seen corresponding path program 1 times [2025-03-17 03:50:27,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:50:27,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242509708] [2025-03-17 03:50:27,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:50:27,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:50:27,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:50:28,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:50:28,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:50:28,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:50:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 03:50:57,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:50:57,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242509708] [2025-03-17 03:50:57,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242509708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:50:57,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:50:57,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 03:50:57,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146818073] [2025-03-17 03:50:57,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:50:57,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 03:50:57,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:50:57,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 03:50:57,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-17 03:50:57,227 INFO L87 Difference]: Start difference. First operand 359 states and 520 transitions. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:50:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:50:59,537 INFO L93 Difference]: Finished difference Result 644 states and 910 transitions. [2025-03-17 03:50:59,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 03:50:59,537 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2025-03-17 03:50:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:50:59,539 INFO L225 Difference]: With dead ends: 644 [2025-03-17 03:50:59,539 INFO L226 Difference]: Without dead ends: 514 [2025-03-17 03:50:59,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2025-03-17 03:50:59,540 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 329 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:50:59,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 827 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 03:50:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-17 03:50:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 355. [2025-03-17 03:50:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 312 states have (on average 1.4006410256410255) internal successors, (437), 312 states have internal predecessors, (437), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 03:50:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 515 transitions. [2025-03-17 03:50:59,566 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 515 transitions. Word has length 94 [2025-03-17 03:50:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:50:59,567 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 515 transitions. [2025-03-17 03:50:59,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 03:50:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 515 transitions. [2025-03-17 03:50:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 03:50:59,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:50:59,568 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:50:59,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 03:50:59,569 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:50:59,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:50:59,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1396004130, now seen corresponding path program 1 times [2025-03-17 03:50:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:50:59,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663180920] [2025-03-17 03:50:59,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:50:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:50:59,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:50:59,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:50:59,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:50:59,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat