./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-86.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_ps-cn-100_file-86.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 4494aec82e3354bd32c6c13af5c36deffc5336d06a7a21928d54585f4657c423 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:48:49,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:48:49,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:48:49,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:48:49,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:48:49,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:48:49,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:48:49,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:48:49,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:48:49,432 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:48:49,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:48:49,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:48:49,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:48:49,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:48:49,433 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:48:49,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:48:49,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:48:49,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:48:49,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:48:49,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:48:49,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:48:49,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:48:49,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:48:49,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:48:49,434 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:48:49,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:48:49,434 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:48:49,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:48:49,434 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:48:49,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:48:49,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:48:49,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:48:49,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:48:49,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:48:49,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:48:49,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:48:49,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:48:49,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:48:49,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:48:49,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:48:49,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:48:49,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:48:49,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:48:49,436 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 -> 4494aec82e3354bd32c6c13af5c36deffc5336d06a7a21928d54585f4657c423 [2025-03-16 23:48:49,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:48:49,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:48:49,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:48:49,689 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:48:49,689 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:48:49,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-86.i [2025-03-16 23:48:50,903 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0f2b021/efda1af39f7445d9995571120813ebfb/FLAGfaa383578 [2025-03-16 23:48:51,166 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:48:51,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-86.i [2025-03-16 23:48:51,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0f2b021/efda1af39f7445d9995571120813ebfb/FLAGfaa383578 [2025-03-16 23:48:51,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0f2b021/efda1af39f7445d9995571120813ebfb [2025-03-16 23:48:51,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:48:51,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:48:51,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:48:51,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:48:51,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:48:51,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:48:51" (1/1) ... [2025-03-16 23:48:51,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321f9e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51, skipping insertion in model container [2025-03-16 23:48:51,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:48:51" (1/1) ... [2025-03-16 23:48:51,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:48:51,335 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_ps-cn-100_file-86.i[916,929] [2025-03-16 23:48:51,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:48:51,413 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:48:51,424 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_ps-cn-100_file-86.i[916,929] [2025-03-16 23:48:51,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:48:51,482 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:48:51,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51 WrapperNode [2025-03-16 23:48:51,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:48:51,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:48:51,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:48:51,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:48:51,490 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:48:51" (1/1) ... [2025-03-16 23:48:51,507 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:48:51" (1/1) ... [2025-03-16 23:48:51,553 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 306 [2025-03-16 23:48:51,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:48:51,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:48:51,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:48:51,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:48:51,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51" (1/1) ... [2025-03-16 23:48:51,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51" (1/1) ... [2025-03-16 23:48:51,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51" (1/1) ... [2025-03-16 23:48:51,594 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:48:51,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51" (1/1) ... [2025-03-16 23:48:51,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51" (1/1) ... [2025-03-16 23:48:51,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51" (1/1) ... [2025-03-16 23:48:51,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51" (1/1) ... [2025-03-16 23:48:51,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51" (1/1) ... [2025-03-16 23:48:51,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51" (1/1) ... [2025-03-16 23:48:51,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:48:51,620 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:48:51,620 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:48:51,620 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:48:51,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51" (1/1) ... [2025-03-16 23:48:51,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:48:51,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:48:51,654 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:48:51,658 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:48:51,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:48:51,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:48:51,676 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:48:51,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:48:51,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:48:51,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:48:51,763 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:48:51,764 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:48:52,292 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-16 23:48:52,292 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:48:52,309 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:48:52,310 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:48:52,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:48:52 BoogieIcfgContainer [2025-03-16 23:48:52,310 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:48:52,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:48:52,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:48:52,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:48:52,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:48:51" (1/3) ... [2025-03-16 23:48:52,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82e687a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:48:52, skipping insertion in model container [2025-03-16 23:48:52,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:48:51" (2/3) ... [2025-03-16 23:48:52,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82e687a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:48:52, skipping insertion in model container [2025-03-16 23:48:52,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:48:52" (3/3) ... [2025-03-16 23:48:52,319 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-86.i [2025-03-16 23:48:52,331 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:48:52,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-86.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:48:52,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:48:52,405 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;@7779bf73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:48:52,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:48:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 82 states have (on average 1.524390243902439) internal successors, (125), 83 states have internal predecessors, (125), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-16 23:48:52,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-16 23:48:52,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:48:52,428 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:52,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:48:52,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:48:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1422048595, now seen corresponding path program 1 times [2025-03-16 23:48:52,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:48:52,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421923103] [2025-03-16 23:48:52,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:52,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:48:52,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 23:48:52,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 23:48:52,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:52,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:48:52,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-03-16 23:48:52,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:48:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421923103] [2025-03-16 23:48:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421923103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:48:52,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291585909] [2025-03-16 23:48:52,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:52,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:48:52,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:48:52,747 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:48:52,751 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:48:52,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 23:48:52,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 23:48:52,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:52,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:48:52,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:48:52,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:48:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-03-16 23:48:53,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:48:53,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291585909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:48:53,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:48:53,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:48:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65242249] [2025-03-16 23:48:53,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:48:53,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:48:53,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:48:53,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:48:53,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:48:53,047 INFO L87 Difference]: Start difference. First operand has 128 states, 82 states have (on average 1.524390243902439) internal successors, (125), 83 states have internal predecessors, (125), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-16 23:48:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:48:53,085 INFO L93 Difference]: Finished difference Result 253 states and 463 transitions. [2025-03-16 23:48:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:48:53,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 266 [2025-03-16 23:48:53,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:48:53,092 INFO L225 Difference]: With dead ends: 253 [2025-03-16 23:48:53,093 INFO L226 Difference]: Without dead ends: 126 [2025-03-16 23:48:53,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 267 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:48:53,100 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:48:53,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:48:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-16 23:48:53,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-16 23:48:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 81 states have internal predecessors, (118), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-16 23:48:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 204 transitions. [2025-03-16 23:48:53,143 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 204 transitions. Word has length 266 [2025-03-16 23:48:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:48:53,143 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 204 transitions. [2025-03-16 23:48:53,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-16 23:48:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 204 transitions. [2025-03-16 23:48:53,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-16 23:48:53,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:48:53,150 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:53,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:48:53,351 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:48:53,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:48:53,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:48:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1879743464, now seen corresponding path program 1 times [2025-03-16 23:48:53,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:48:53,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847893426] [2025-03-16 23:48:53,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:53,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:48:53,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 23:48:53,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 23:48:53,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:53,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:48:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-16 23:48:53,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:48:53,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847893426] [2025-03-16 23:48:53,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847893426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:48:53,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:48:53,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:48:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102447081] [2025-03-16 23:48:53,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:48:53,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:48:53,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:48:53,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:48:53,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:48:53,831 INFO L87 Difference]: Start difference. First operand 126 states and 204 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:48:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:48:54,176 INFO L93 Difference]: Finished difference Result 377 states and 611 transitions. [2025-03-16 23:48:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:48:54,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 266 [2025-03-16 23:48:54,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:48:54,181 INFO L225 Difference]: With dead ends: 377 [2025-03-16 23:48:54,182 INFO L226 Difference]: Without dead ends: 252 [2025-03-16 23:48:54,184 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:48:54,184 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 188 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:48:54,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 691 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:48:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-16 23:48:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2025-03-16 23:48:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 144 states have (on average 1.4375) internal successors, (207), 144 states have internal predecessors, (207), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 23:48:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 379 transitions. [2025-03-16 23:48:54,233 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 379 transitions. Word has length 266 [2025-03-16 23:48:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:48:54,234 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 379 transitions. [2025-03-16 23:48:54,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:48:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 379 transitions. [2025-03-16 23:48:54,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-16 23:48:54,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:48:54,240 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:54,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:48:54,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:48:54,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:48:54,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1586340457, now seen corresponding path program 1 times [2025-03-16 23:48:54,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:48:54,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889942077] [2025-03-16 23:48:54,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:48:54,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:48:54,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 23:48:54,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 23:48:54,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:48:54,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:49:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-16 23:49:00,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:49:00,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889942077] [2025-03-16 23:49:00,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889942077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:49:00,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:49:00,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:49:00,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677182006] [2025-03-16 23:49:00,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:49:00,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:49:00,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:49:00,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:49:00,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:49:00,232 INFO L87 Difference]: Start difference. First operand 233 states and 379 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:49:02,429 INFO L93 Difference]: Finished difference Result 429 states and 683 transitions. [2025-03-16 23:49:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:49:02,430 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 266 [2025-03-16 23:49:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:49:02,433 INFO L225 Difference]: With dead ends: 429 [2025-03-16 23:49:02,435 INFO L226 Difference]: Without dead ends: 304 [2025-03-16 23:49:02,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-03-16 23:49:02,437 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 345 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:49:02,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1098 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 23:49:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-16 23:49:02,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 249. [2025-03-16 23:49:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 160 states have (on average 1.43125) internal successors, (229), 160 states have internal predecessors, (229), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 23:49:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 401 transitions. [2025-03-16 23:49:02,474 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 401 transitions. Word has length 266 [2025-03-16 23:49:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:49:02,476 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 401 transitions. [2025-03-16 23:49:02,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 401 transitions. [2025-03-16 23:49:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-16 23:49:02,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:49:02,479 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:02,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:49:02,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:49:02,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:49:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1389826952, now seen corresponding path program 1 times [2025-03-16 23:49:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:49:02,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114695303] [2025-03-16 23:49:02,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:49:02,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:49:02,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 23:49:02,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 23:49:02,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:49:02,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:49:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-16 23:49:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:49:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114695303] [2025-03-16 23:49:02,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114695303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:49:02,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:49:02,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:49:02,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953409057] [2025-03-16 23:49:02,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:49:02,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:49:02,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:49:02,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:49:02,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:49:02,574 INFO L87 Difference]: Start difference. First operand 249 states and 401 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:49:02,623 INFO L93 Difference]: Finished difference Result 498 states and 805 transitions. [2025-03-16 23:49:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:49:02,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 266 [2025-03-16 23:49:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:49:02,627 INFO L225 Difference]: With dead ends: 498 [2025-03-16 23:49:02,627 INFO L226 Difference]: Without dead ends: 373 [2025-03-16 23:49:02,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:49:02,631 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 196 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:49:02,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 403 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:49:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-16 23:49:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2025-03-16 23:49:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 238 states have (on average 1.4285714285714286) internal successors, (340), 238 states have internal predecessors, (340), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-16 23:49:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 598 transitions. [2025-03-16 23:49:02,677 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 598 transitions. Word has length 266 [2025-03-16 23:49:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:49:02,678 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 598 transitions. [2025-03-16 23:49:02,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:02,678 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 598 transitions. [2025-03-16 23:49:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-16 23:49:02,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:49:02,680 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:02,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:49:02,681 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:49:02,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:49:02,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1934746012, now seen corresponding path program 1 times [2025-03-16 23:49:02,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:49:02,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996479828] [2025-03-16 23:49:02,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:49:02,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:49:02,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 23:49:02,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 23:49:02,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:49:02,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:49:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-16 23:49:07,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:49:07,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996479828] [2025-03-16 23:49:07,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996479828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:49:07,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:49:07,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:49:07,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158963645] [2025-03-16 23:49:07,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:49:07,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:49:07,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:49:07,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:49:07,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:49:07,720 INFO L87 Difference]: Start difference. First operand 371 states and 598 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:49:09,866 INFO L93 Difference]: Finished difference Result 417 states and 652 transitions. [2025-03-16 23:49:09,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:49:09,867 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 267 [2025-03-16 23:49:09,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:49:09,874 INFO L225 Difference]: With dead ends: 417 [2025-03-16 23:49:09,874 INFO L226 Difference]: Without dead ends: 415 [2025-03-16 23:49:09,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2025-03-16 23:49:09,875 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 460 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:49:09,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 969 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 23:49:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-16 23:49:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 372. [2025-03-16 23:49:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 239 states have (on average 1.4267782426778242) internal successors, (341), 239 states have internal predecessors, (341), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-16 23:49:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 599 transitions. [2025-03-16 23:49:09,923 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 599 transitions. Word has length 267 [2025-03-16 23:49:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:49:09,925 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 599 transitions. [2025-03-16 23:49:09,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 599 transitions. [2025-03-16 23:49:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-16 23:49:09,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:49:09,928 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:09,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:49:09,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:49:09,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:49:09,931 INFO L85 PathProgramCache]: Analyzing trace with hash 360441791, now seen corresponding path program 1 times [2025-03-16 23:49:09,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:49:09,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489019585] [2025-03-16 23:49:09,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:49:09,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:49:09,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 23:49:09,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 23:49:09,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:49:09,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:49:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-16 23:49:10,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:49:10,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489019585] [2025-03-16 23:49:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489019585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:49:10,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:49:10,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:49:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122732824] [2025-03-16 23:49:10,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:49:10,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:49:10,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:49:10,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:49:10,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:49:10,086 INFO L87 Difference]: Start difference. First operand 372 states and 599 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:49:10,113 INFO L93 Difference]: Finished difference Result 630 states and 1014 transitions. [2025-03-16 23:49:10,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:49:10,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 267 [2025-03-16 23:49:10,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:49:10,117 INFO L225 Difference]: With dead ends: 630 [2025-03-16 23:49:10,119 INFO L226 Difference]: Without dead ends: 380 [2025-03-16 23:49:10,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:49:10,120 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:49:10,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 390 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:49:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-16 23:49:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 372. [2025-03-16 23:49:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 239 states have (on average 1.4142259414225942) internal successors, (338), 239 states have internal predecessors, (338), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-16 23:49:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 596 transitions. [2025-03-16 23:49:10,148 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 596 transitions. Word has length 267 [2025-03-16 23:49:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:49:10,149 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 596 transitions. [2025-03-16 23:49:10,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 596 transitions. [2025-03-16 23:49:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-16 23:49:10,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:49:10,152 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:10,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:49:10,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:49:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:49:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash 389070942, now seen corresponding path program 1 times [2025-03-16 23:49:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:49:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154406712] [2025-03-16 23:49:10,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:49:10,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:49:10,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 23:49:10,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 23:49:10,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:49:10,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:49:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-16 23:49:12,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:49:12,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154406712] [2025-03-16 23:49:12,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154406712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:49:12,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:49:12,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:49:12,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842622720] [2025-03-16 23:49:12,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:49:12,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:49:12,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:49:12,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:49:12,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:49:12,697 INFO L87 Difference]: Start difference. First operand 372 states and 596 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:49:13,501 INFO L93 Difference]: Finished difference Result 417 states and 647 transitions. [2025-03-16 23:49:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:49:13,502 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 267 [2025-03-16 23:49:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:49:13,504 INFO L225 Difference]: With dead ends: 417 [2025-03-16 23:49:13,505 INFO L226 Difference]: Without dead ends: 415 [2025-03-16 23:49:13,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2025-03-16 23:49:13,506 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 285 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:49:13,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1249 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:49:13,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-16 23:49:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 372. [2025-03-16 23:49:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 239 states have (on average 1.4142259414225942) internal successors, (338), 239 states have internal predecessors, (338), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-16 23:49:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 596 transitions. [2025-03-16 23:49:13,533 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 596 transitions. Word has length 267 [2025-03-16 23:49:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:49:13,534 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 596 transitions. [2025-03-16 23:49:13,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 596 transitions. [2025-03-16 23:49:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-16 23:49:13,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:49:13,537 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:13,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:49:13,537 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:49:13,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:49:13,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1322337536, now seen corresponding path program 1 times [2025-03-16 23:49:13,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:49:13,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554364390] [2025-03-16 23:49:13,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:49:13,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:49:13,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 23:49:13,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 23:49:13,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:49:13,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:49:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-16 23:49:19,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:49:19,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554364390] [2025-03-16 23:49:19,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554364390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:49:19,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:49:19,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:49:19,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275514341] [2025-03-16 23:49:19,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:49:19,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:49:19,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:49:19,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:49:19,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:49:19,227 INFO L87 Difference]: Start difference. First operand 372 states and 596 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:24,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:49:24,016 INFO L93 Difference]: Finished difference Result 436 states and 669 transitions. [2025-03-16 23:49:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 23:49:24,017 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 267 [2025-03-16 23:49:24,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:49:24,021 INFO L225 Difference]: With dead ends: 436 [2025-03-16 23:49:24,021 INFO L226 Difference]: Without dead ends: 434 [2025-03-16 23:49:24,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-03-16 23:49:24,022 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 276 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:49:24,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1134 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 23:49:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-03-16 23:49:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 381. [2025-03-16 23:49:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 248 states have (on average 1.4112903225806452) internal successors, (350), 248 states have internal predecessors, (350), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-16 23:49:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 608 transitions. [2025-03-16 23:49:24,059 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 608 transitions. Word has length 267 [2025-03-16 23:49:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:49:24,060 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 608 transitions. [2025-03-16 23:49:24,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 608 transitions. [2025-03-16 23:49:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-16 23:49:24,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:49:24,064 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:24,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:49:24,064 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:49:24,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:49:24,065 INFO L85 PathProgramCache]: Analyzing trace with hash 420472799, now seen corresponding path program 1 times [2025-03-16 23:49:24,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:49:24,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101377921] [2025-03-16 23:49:24,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:49:24,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:49:24,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 23:49:24,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 23:49:24,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:49:24,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:49:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-16 23:49:30,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:49:30,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101377921] [2025-03-16 23:49:30,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101377921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:49:30,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:49:30,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:49:30,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561881380] [2025-03-16 23:49:30,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:49:30,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:49:30,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:49:30,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:49:30,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:49:30,416 INFO L87 Difference]: Start difference. First operand 381 states and 608 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:49:35,848 INFO L93 Difference]: Finished difference Result 430 states and 663 transitions. [2025-03-16 23:49:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 23:49:35,849 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 267 [2025-03-16 23:49:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:49:35,852 INFO L225 Difference]: With dead ends: 430 [2025-03-16 23:49:35,852 INFO L226 Difference]: Without dead ends: 428 [2025-03-16 23:49:35,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=271, Invalid=599, Unknown=0, NotChecked=0, Total=870 [2025-03-16 23:49:35,853 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 308 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:49:35,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1157 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 23:49:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-16 23:49:35,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 381. [2025-03-16 23:49:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 248 states have (on average 1.4112903225806452) internal successors, (350), 248 states have internal predecessors, (350), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-16 23:49:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 608 transitions. [2025-03-16 23:49:35,880 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 608 transitions. Word has length 267 [2025-03-16 23:49:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:49:35,880 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 608 transitions. [2025-03-16 23:49:35,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 608 transitions. [2025-03-16 23:49:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-16 23:49:35,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:49:35,882 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:35,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 23:49:35,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:49:35,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:49:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash -820870585, now seen corresponding path program 1 times [2025-03-16 23:49:35,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:49:35,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45446207] [2025-03-16 23:49:35,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:49:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:49:35,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 23:49:35,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 23:49:35,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:49:35,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:49:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-16 23:49:44,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:49:44,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45446207] [2025-03-16 23:49:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45446207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:49:44,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:49:44,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 23:49:44,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672900177] [2025-03-16 23:49:44,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:49:44,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 23:49:44,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:49:44,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 23:49:44,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:49:44,057 INFO L87 Difference]: Start difference. First operand 381 states and 608 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:49:48,722 INFO L93 Difference]: Finished difference Result 417 states and 648 transitions. [2025-03-16 23:49:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 23:49:48,724 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 268 [2025-03-16 23:49:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:49:48,726 INFO L225 Difference]: With dead ends: 417 [2025-03-16 23:49:48,726 INFO L226 Difference]: Without dead ends: 415 [2025-03-16 23:49:48,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2025-03-16 23:49:48,727 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 285 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:49:48,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1167 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 23:49:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-16 23:49:48,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 378. [2025-03-16 23:49:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 245 states have (on average 1.4122448979591837) internal successors, (346), 245 states have internal predecessors, (346), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-16 23:49:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 604 transitions. [2025-03-16 23:49:48,752 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 604 transitions. Word has length 268 [2025-03-16 23:49:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:49:48,753 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 604 transitions. [2025-03-16 23:49:48,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:49:48,753 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 604 transitions. [2025-03-16 23:49:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-16 23:49:48,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:49:48,755 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:48,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 23:49:48,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:49:48,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:49:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1960071236, now seen corresponding path program 1 times [2025-03-16 23:49:48,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:49:48,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318602143] [2025-03-16 23:49:48,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:49:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:49:48,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 23:49:48,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 23:49:48,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:49:48,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:49:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-16 23:49:56,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:49:56,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318602143] [2025-03-16 23:49:56,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318602143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:49:56,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:49:56,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 23:49:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690863476] [2025-03-16 23:49:56,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:49:56,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 23:49:56,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:49:56,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 23:49:56,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:49:56,516 INFO L87 Difference]: Start difference. First operand 378 states and 604 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:50:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:50:05,881 INFO L93 Difference]: Finished difference Result 431 states and 664 transitions. [2025-03-16 23:50:05,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 23:50:05,882 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 268 [2025-03-16 23:50:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:50:05,885 INFO L225 Difference]: With dead ends: 431 [2025-03-16 23:50:05,885 INFO L226 Difference]: Without dead ends: 429 [2025-03-16 23:50:05,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2025-03-16 23:50:05,887 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 399 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:50:05,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1034 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 23:50:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-16 23:50:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 383. [2025-03-16 23:50:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 250 states have (on average 1.412) internal successors, (353), 250 states have internal predecessors, (353), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-16 23:50:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2025-03-16 23:50:05,929 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 268 [2025-03-16 23:50:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:50:05,930 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2025-03-16 23:50:05,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-16 23:50:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2025-03-16 23:50:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-16 23:50:05,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:50:05,931 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 23:50:05,932 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:50:05,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:50:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash 414366375, now seen corresponding path program 1 times [2025-03-16 23:50:05,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:50:05,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517627451] [2025-03-16 23:50:05,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:50:05,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:50:05,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 23:50:05,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 23:50:05,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:50:05,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:50:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-16 23:50:14,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:50:14,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517627451] [2025-03-16 23:50:14,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517627451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:50:14,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:50:14,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-16 23:50:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827955291] [2025-03-16 23:50:14,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:50:14,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 23:50:14,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:50:14,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 23:50:14,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-03-16 23:50:14,927 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43)