./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_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_fillercode_fillercodesize_normal_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 5f70a8d930c5557b68c07ef577122d328ec387effee8f919b747045b88161608 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:30:51,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:30:51,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:30:51,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:30:51,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:30:51,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:30:51,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:30:51,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:30:51,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:30:51,283 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:30:51,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:30:51,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:30:51,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:30:51,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:30:51,284 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:30:51,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:30:51,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:30:51,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:30:51,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:30:51,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:30:51,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:30:51,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:30:51,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:30:51,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:30:51,285 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:30:51,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:30:51,285 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:30:51,285 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:30:51,285 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:30:51,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:30:51,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:30:51,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:30:51,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:30:51,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:30:51,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:30:51,286 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:30:51,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:30:51,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:30:51,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:30:51,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:30:51,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:30:51,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:30:51,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:30:51,287 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 -> 5f70a8d930c5557b68c07ef577122d328ec387effee8f919b747045b88161608 [2025-03-16 23:30:51,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:30:51,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:30:51,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:30:51,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:30:51,534 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:30:51,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i [2025-03-16 23:30:52,689 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb33521e1/9f92b3937425446aa5ec3daefb2dc9bf/FLAGe53b64b8b [2025-03-16 23:30:52,950 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:30:52,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i [2025-03-16 23:30:52,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb33521e1/9f92b3937425446aa5ec3daefb2dc9bf/FLAGe53b64b8b [2025-03-16 23:30:53,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb33521e1/9f92b3937425446aa5ec3daefb2dc9bf [2025-03-16 23:30:53,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:30:53,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:30:53,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:30:53,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:30:53,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:30:53,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53, skipping insertion in model container [2025-03-16 23:30:53,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:30:53,367 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_fillercode_fillercodesize_normal_file-34.i[913,926] [2025-03-16 23:30:53,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:30:53,425 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:30:53,433 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_fillercode_fillercodesize_normal_file-34.i[913,926] [2025-03-16 23:30:53,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:30:53,470 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:30:53,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53 WrapperNode [2025-03-16 23:30:53,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:30:53,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:30:53,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:30:53,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:30:53,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,501 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-03-16 23:30:53,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:30:53,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:30:53,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:30:53,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:30:53,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,527 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:30:53,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:30:53,537 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:30:53,540 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:30:53,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:30:53,541 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (1/1) ... [2025-03-16 23:30:53,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:30:53,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:30:53,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:30:53,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:30:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:30:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:30:53,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:30:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:30:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:30:53,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:30:53,637 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:30:53,639 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:30:53,954 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-16 23:30:53,984 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-16 23:30:53,984 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:30:54,001 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:30:54,001 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:30:54,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:30:54 BoogieIcfgContainer [2025-03-16 23:30:54,001 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:30:54,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:30:54,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:30:54,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:30:54,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:30:53" (1/3) ... [2025-03-16 23:30:54,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e1e5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:30:54, skipping insertion in model container [2025-03-16 23:30:54,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:30:53" (2/3) ... [2025-03-16 23:30:54,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e1e5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:30:54, skipping insertion in model container [2025-03-16 23:30:54,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:30:54" (3/3) ... [2025-03-16 23:30:54,009 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-34.i [2025-03-16 23:30:54,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:30:54,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-34.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:30:54,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:30:54,059 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;@6fbc33d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:30:54,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:30:54,061 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-16 23:30:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 23:30:54,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:30:54,070 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-16 23:30:54,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:30:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:30:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash -877579791, now seen corresponding path program 1 times [2025-03-16 23:30:54,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:30:54,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636574877] [2025-03-16 23:30:54,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:30:54,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:30:54,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 23:30:54,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 23:30:54,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:30:54,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:30:54,254 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-16 23:30:54,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:30:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636574877] [2025-03-16 23:30:54,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636574877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:30:54,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816778437] [2025-03-16 23:30:54,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:30:54,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:30:54,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:30:54,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:30:54,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:30:54,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 23:30:54,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 23:30:54,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:30:54,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:30:54,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:30:54,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:30:54,380 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-16 23:30:54,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:30:54,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816778437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:30:54,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:30:54,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:30:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036468247] [2025-03-16 23:30:54,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:30:54,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:30:54,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:30:54,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:30:54,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:30:54,399 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-16 23:30:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:30:54,418 INFO L93 Difference]: Finished difference Result 129 states and 215 transitions. [2025-03-16 23:30:54,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:30:54,419 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-16 23:30:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:30:54,423 INFO L225 Difference]: With dead ends: 129 [2025-03-16 23:30:54,424 INFO L226 Difference]: Without dead ends: 64 [2025-03-16 23:30:54,426 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-16 23:30:54,429 INFO L435 NwaCegarLoop]: 94 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, 94 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-16 23:30:54,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:30:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-16 23:30:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-16 23:30:54,449 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-16 23:30:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2025-03-16 23:30:54,454 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 91 [2025-03-16 23:30:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:30:54,455 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2025-03-16 23:30:54,455 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-16 23:30:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2025-03-16 23:30:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 23:30:54,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:30:54,457 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-16 23:30:54,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:30:54,657 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-16 23:30:54,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:30:54,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:30:54,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1206038322, now seen corresponding path program 1 times [2025-03-16 23:30:54,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:30:54,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957352237] [2025-03-16 23:30:54,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:30:54,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:30:54,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 23:30:54,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 23:30:54,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:30:54,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:30:55,060 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-16 23:30:55,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:30:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957352237] [2025-03-16 23:30:55,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957352237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:30:55,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:30:55,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:30:55,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580057840] [2025-03-16 23:30:55,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:30:55,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:30:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:30:55,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:30:55,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:30:55,064 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-16 23:30:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:30:55,201 INFO L93 Difference]: Finished difference Result 220 states and 337 transitions. [2025-03-16 23:30:55,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:30:55,202 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-16 23:30:55,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:30:55,204 INFO L225 Difference]: With dead ends: 220 [2025-03-16 23:30:55,205 INFO L226 Difference]: Without dead ends: 157 [2025-03-16 23:30:55,206 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-16 23:30:55,206 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-16 23:30:55,206 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-16 23:30:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-16 23:30:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 127. [2025-03-16 23:30:55,221 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-16 23:30:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 195 transitions. [2025-03-16 23:30:55,222 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 195 transitions. Word has length 91 [2025-03-16 23:30:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:30:55,222 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 195 transitions. [2025-03-16 23:30:55,222 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-16 23:30:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 195 transitions. [2025-03-16 23:30:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 23:30:55,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:30:55,225 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-16 23:30:55,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:30:55,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:30:55,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:30:55,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1830948759, now seen corresponding path program 1 times [2025-03-16 23:30:55,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:30:55,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212455594] [2025-03-16 23:30:55,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:30:55,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:30:55,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 23:30:55,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 23:30:55,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:30:55,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:30:55,435 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-16 23:30:55,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:30:55,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212455594] [2025-03-16 23:30:55,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212455594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:30:55,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:30:55,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:30:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346552338] [2025-03-16 23:30:55,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:30:55,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:30:55,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:30:55,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:30:55,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:30:55,438 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-16 23:30:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:30:55,628 INFO L93 Difference]: Finished difference Result 374 states and 572 transitions. [2025-03-16 23:30:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:30:55,629 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-16 23:30:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:30:55,631 INFO L225 Difference]: With dead ends: 374 [2025-03-16 23:30:55,632 INFO L226 Difference]: Without dead ends: 248 [2025-03-16 23:30:55,633 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-16 23:30:55,635 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.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:30:55,635 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.2s Time] [2025-03-16 23:30:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-16 23:30:55,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 131. [2025-03-16 23:30:55,657 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-16 23:30:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2025-03-16 23:30:55,661 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 92 [2025-03-16 23:30:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:30:55,661 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2025-03-16 23:30:55,663 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-16 23:30:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2025-03-16 23:30:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 23:30:55,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:30:55,665 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-16 23:30:55,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:30:55,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:30:55,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:30:55,666 INFO L85 PathProgramCache]: Analyzing trace with hash -862702033, now seen corresponding path program 1 times [2025-03-16 23:30:55,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:30:55,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067078302] [2025-03-16 23:30:55,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:30:55,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:30:55,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 23:30:55,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 23:30:55,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:30:55,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:30:57,632 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-16 23:30:57,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:30:57,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067078302] [2025-03-16 23:30:57,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067078302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:30:57,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:30:57,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 23:30:57,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518051343] [2025-03-16 23:30:57,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:30:57,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 23:30:57,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:30:57,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 23:30:57,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 23:30:57,635 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-16 23:30:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:30:58,095 INFO L93 Difference]: Finished difference Result 421 states and 633 transitions. [2025-03-16 23:30:58,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 23:30:58,095 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-16 23:30:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:30:58,097 INFO L225 Difference]: With dead ends: 421 [2025-03-16 23:30:58,097 INFO L226 Difference]: Without dead ends: 291 [2025-03-16 23:30:58,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:30:58,099 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-16 23:30:58,099 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-16 23:30:58,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-16 23:30:58,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2025-03-16 23:30:58,128 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-16 23:30:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 269 transitions. [2025-03-16 23:30:58,130 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 269 transitions. Word has length 93 [2025-03-16 23:30:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:30:58,131 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 269 transitions. [2025-03-16 23:30:58,131 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-16 23:30:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 269 transitions. [2025-03-16 23:30:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 23:30:58,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:30:58,133 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-16 23:30:58,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:30:58,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:30:58,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:30:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1882690570, now seen corresponding path program 1 times [2025-03-16 23:30:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:30:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465324752] [2025-03-16 23:30:58,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:30:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:30:58,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 23:30:58,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 23:30:58,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:30:58,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:04,512 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-16 23:31:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:31:04,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465324752] [2025-03-16 23:31:04,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465324752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:31:04,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:31:04,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:31:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938683082] [2025-03-16 23:31:04,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:31:04,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:31:04,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:31:04,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:31:04,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:31:04,514 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-16 23:31:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:31:06,786 INFO L93 Difference]: Finished difference Result 629 states and 920 transitions. [2025-03-16 23:31:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 23:31:06,786 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-16 23:31:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:31:06,790 INFO L225 Difference]: With dead ends: 629 [2025-03-16 23:31:06,790 INFO L226 Difference]: Without dead ends: 482 [2025-03-16 23:31:06,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-03-16 23:31:06,792 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 603 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:31:06,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 567 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 23:31:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-16 23:31:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 266. [2025-03-16 23:31:06,815 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-16 23:31:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 396 transitions. [2025-03-16 23:31:06,826 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 396 transitions. Word has length 93 [2025-03-16 23:31:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:31:06,827 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 396 transitions. [2025-03-16 23:31:06,827 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-16 23:31:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 396 transitions. [2025-03-16 23:31:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 23:31:06,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:06,830 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-16 23:31:06,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:31:06,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:06,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:06,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1524773045, now seen corresponding path program 1 times [2025-03-16 23:31:06,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:31:06,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87645571] [2025-03-16 23:31:06,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:31:06,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 23:31:06,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 23:31:06,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:06,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:08,115 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-16 23:31:08,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:31:08,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87645571] [2025-03-16 23:31:08,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87645571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:31:08,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:31:08,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:31:08,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634553908] [2025-03-16 23:31:08,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:31:08,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:31:08,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:31:08,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:31:08,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:31:08,117 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-16 23:31:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:31:08,841 INFO L93 Difference]: Finished difference Result 623 states and 930 transitions. [2025-03-16 23:31:08,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:31:08,842 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-16 23:31:08,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:31:08,844 INFO L225 Difference]: With dead ends: 623 [2025-03-16 23:31:08,844 INFO L226 Difference]: Without dead ends: 477 [2025-03-16 23:31:08,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:31:08,845 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 373 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:31:08,845 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.4s Time] [2025-03-16 23:31:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-16 23:31:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 311. [2025-03-16 23:31:08,861 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-16 23:31:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 455 transitions. [2025-03-16 23:31:08,863 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 455 transitions. Word has length 93 [2025-03-16 23:31:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:31:08,863 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 455 transitions. [2025-03-16 23:31:08,863 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-16 23:31:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 455 transitions. [2025-03-16 23:31:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 23:31:08,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:08,864 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-16 23:31:08,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:31:08,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:08,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash 75236107, now seen corresponding path program 1 times [2025-03-16 23:31:08,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:31:08,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081286154] [2025-03-16 23:31:08,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:08,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:31:08,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 23:31:08,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 23:31:08,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:08,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:09,964 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-16 23:31:09,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:31:09,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081286154] [2025-03-16 23:31:09,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081286154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:31:09,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:31:09,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:31:09,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786093428] [2025-03-16 23:31:09,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:31:09,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:31:09,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:31:09,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:31:09,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:31:09,965 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-16 23:31:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:31:10,769 INFO L93 Difference]: Finished difference Result 613 states and 895 transitions. [2025-03-16 23:31:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:31:10,770 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-16 23:31:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:31:10,772 INFO L225 Difference]: With dead ends: 613 [2025-03-16 23:31:10,772 INFO L226 Difference]: Without dead ends: 469 [2025-03-16 23:31:10,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-16 23:31:10,773 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-16 23:31:10,774 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-16 23:31:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-16 23:31:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 367. [2025-03-16 23:31:10,807 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-16 23:31:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 545 transitions. [2025-03-16 23:31:10,809 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 545 transitions. Word has length 93 [2025-03-16 23:31:10,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:31:10,809 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 545 transitions. [2025-03-16 23:31:10,810 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-16 23:31:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 545 transitions. [2025-03-16 23:31:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 23:31:10,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:10,811 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-16 23:31:10,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:31:10,812 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:10,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1368260658, now seen corresponding path program 1 times [2025-03-16 23:31:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:31:10,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080577626] [2025-03-16 23:31:10,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:10,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:31:10,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 23:31:10,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 23:31:10,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:10,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:11,000 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-16 23:31:11,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:31:11,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080577626] [2025-03-16 23:31:11,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080577626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:31:11,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:31:11,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:31:11,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402591665] [2025-03-16 23:31:11,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:31:11,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:31:11,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:31:11,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:31:11,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:31:11,003 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-16 23:31:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:31:11,155 INFO L93 Difference]: Finished difference Result 581 states and 866 transitions. [2025-03-16 23:31:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:31:11,156 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-16 23:31:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:31:11,159 INFO L225 Difference]: With dead ends: 581 [2025-03-16 23:31:11,159 INFO L226 Difference]: Without dead ends: 357 [2025-03-16 23:31:11,160 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-16 23:31:11,160 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:31:11,160 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.1s Time] [2025-03-16 23:31:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-16 23:31:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 329. [2025-03-16 23:31:11,180 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-16 23:31:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 479 transitions. [2025-03-16 23:31:11,181 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 479 transitions. Word has length 93 [2025-03-16 23:31:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:31:11,181 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 479 transitions. [2025-03-16 23:31:11,181 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-16 23:31:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 479 transitions. [2025-03-16 23:31:11,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 23:31:11,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:11,182 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-16 23:31:11,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:31:11,183 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:11,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:11,183 INFO L85 PathProgramCache]: Analyzing trace with hash -885469953, now seen corresponding path program 1 times [2025-03-16 23:31:11,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:31:11,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905916830] [2025-03-16 23:31:11,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:11,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:31:11,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 23:31:11,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 23:31:11,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:11,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:31:35,191 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-16 23:31:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:31:35,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905916830] [2025-03-16 23:31:35,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905916830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:31:35,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:31:35,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 23:31:35,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784357764] [2025-03-16 23:31:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:31:35,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 23:31:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:31:35,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 23:31:35,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:31:35,192 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-16 23:31:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:31:37,066 INFO L93 Difference]: Finished difference Result 704 states and 1011 transitions. [2025-03-16 23:31:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:31:37,066 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-16 23:31:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:31:37,068 INFO L225 Difference]: With dead ends: 704 [2025-03-16 23:31:37,068 INFO L226 Difference]: Without dead ends: 514 [2025-03-16 23:31:37,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2025-03-16 23:31:37,069 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 348 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:31:37,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 761 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 23:31:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-16 23:31:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 359. [2025-03-16 23:31:37,086 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-16 23:31:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 520 transitions. [2025-03-16 23:31:37,088 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 520 transitions. Word has length 94 [2025-03-16 23:31:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:31:37,088 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 520 transitions. [2025-03-16 23:31:37,088 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-16 23:31:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 520 transitions. [2025-03-16 23:31:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 23:31:37,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:31:37,089 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-16 23:31:37,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 23:31:37,089 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:31:37,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:31:37,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1602042880, now seen corresponding path program 1 times [2025-03-16 23:31:37,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:31:37,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345022087] [2025-03-16 23:31:37,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:31:37,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:31:37,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 23:31:37,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 23:31:37,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:31:37,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:32:01,728 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-16 23:32:01,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:32:01,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345022087] [2025-03-16 23:32:01,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345022087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:32:01,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:32:01,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 23:32:01,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346809820] [2025-03-16 23:32:01,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:32:01,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 23:32:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:32:01,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 23:32:01,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-16 23:32:01,729 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-16 23:32:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:32:03,617 INFO L93 Difference]: Finished difference Result 644 states and 910 transitions. [2025-03-16 23:32:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 23:32:03,617 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-16 23:32:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:32:03,619 INFO L225 Difference]: With dead ends: 644 [2025-03-16 23:32:03,619 INFO L226 Difference]: Without dead ends: 514 [2025-03-16 23:32:03,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2025-03-16 23:32:03,621 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 323 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:32:03,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 857 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 23:32:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-16 23:32:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 355. [2025-03-16 23:32:03,638 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-16 23:32:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 515 transitions. [2025-03-16 23:32:03,640 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 515 transitions. Word has length 94 [2025-03-16 23:32:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:32:03,640 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 515 transitions. [2025-03-16 23:32:03,640 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-16 23:32:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 515 transitions. [2025-03-16 23:32:03,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 23:32:03,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:32:03,641 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-16 23:32:03,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 23:32:03,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:32:03,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:32:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1396004130, now seen corresponding path program 1 times [2025-03-16 23:32:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:32:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143499960] [2025-03-16 23:32:03,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:32:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:32:03,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 23:32:03,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 23:32:03,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:32:03,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:32:26,949 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-16 23:32:26,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:32:26,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143499960] [2025-03-16 23:32:26,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143499960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:32:26,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:32:26,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 23:32:26,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854386886] [2025-03-16 23:32:26,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:32:26,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 23:32:26,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:32:26,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 23:32:26,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:32:26,951 INFO L87 Difference]: Start difference. First operand 355 states and 515 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)