./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-66.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_variablewrapping_normal_file-66.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 2463f96020283dc976a48e4624a0a64ed4b926874e2dafad9e507fb796d4e148 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:15:01,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:15:01,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:15:01,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:15:01,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:15:01,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:15:01,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:15:01,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:15:01,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:15:01,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:15:01,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:15:01,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:15:01,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:15:01,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:15:01,411 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:15:01,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:15:01,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:15:01,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:15:01,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:15:01,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:15:01,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:15:01,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:15:01,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:15:01,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:15:01,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:15:01,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:15:01,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:15:01,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:15:01,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:15:01,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:15:01,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:15:01,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:15:01,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:15:01,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:15:01,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:15:01,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:15:01,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:15:01,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:15:01,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:15:01,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:15:01,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:15:01,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:15:01,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:15:01,414 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 -> 2463f96020283dc976a48e4624a0a64ed4b926874e2dafad9e507fb796d4e148 [2025-03-17 05:15:01,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:15:01,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:15:01,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:15:01,655 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:15:01,655 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:15:01,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-66.i [2025-03-17 05:15:02,866 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d3a8b5f/9a8dfe53041f47458aec74096ca8df69/FLAG0f7554903 [2025-03-17 05:15:03,123 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:15:03,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-66.i [2025-03-17 05:15:03,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d3a8b5f/9a8dfe53041f47458aec74096ca8df69/FLAG0f7554903 [2025-03-17 05:15:03,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d3a8b5f/9a8dfe53041f47458aec74096ca8df69 [2025-03-17 05:15:03,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:15:03,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:15:03,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:15:03,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:15:03,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:15:03,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a759e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03, skipping insertion in model container [2025-03-17 05:15:03,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:15:03,282 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_variablewrapping_normal_file-66.i[913,926] [2025-03-17 05:15:03,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:15:03,332 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:15:03,339 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_variablewrapping_normal_file-66.i[913,926] [2025-03-17 05:15:03,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:15:03,379 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:15:03,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03 WrapperNode [2025-03-17 05:15:03,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:15:03,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:15:03,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:15:03,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:15:03,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,424 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-03-17 05:15:03,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:15:03,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:15:03,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:15:03,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:15:03,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,456 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 05:15:03,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,465 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:15:03,475 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:15:03,475 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:15:03,475 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:15:03,476 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (1/1) ... [2025-03-17 05:15:03,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:15:03,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:15:03,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:15:03,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:15:03,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:15:03,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:15:03,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:15:03,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:15:03,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:15:03,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:15:03,587 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:15:03,588 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:15:03,779 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 05:15:03,780 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:15:03,787 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:15:03,788 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:15:03,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:15:03 BoogieIcfgContainer [2025-03-17 05:15:03,789 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:15:03,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:15:03,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:15:03,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:15:03,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:15:03" (1/3) ... [2025-03-17 05:15:03,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9b4242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:15:03, skipping insertion in model container [2025-03-17 05:15:03,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:15:03" (2/3) ... [2025-03-17 05:15:03,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9b4242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:15:03, skipping insertion in model container [2025-03-17 05:15:03,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:15:03" (3/3) ... [2025-03-17 05:15:03,798 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-66.i [2025-03-17 05:15:03,809 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:15:03,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-66.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:15:03,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:15:03,863 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;@44a4e002, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:15:03,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:15:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:15:03,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 05:15:03,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:03,874 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:03,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:03,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:03,878 INFO L85 PathProgramCache]: Analyzing trace with hash -939086153, now seen corresponding path program 1 times [2025-03-17 05:15:03,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:03,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558952549] [2025-03-17 05:15:03,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:03,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:03,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 05:15:03,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 05:15:03,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:03,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:15:04,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:04,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558952549] [2025-03-17 05:15:04,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558952549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:15:04,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632385332] [2025-03-17 05:15:04,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:04,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:15:04,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:15:04,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:15:04,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:15:04,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 05:15:04,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 05:15:04,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:04,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:04,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:15:04,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:15:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:15:04,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:15:04,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632385332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:15:04,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:15:04,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:15:04,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342323774] [2025-03-17 05:15:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:15:04,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:15:04,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:15:04,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:15:04,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:15:04,205 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:15:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:04,237 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2025-03-17 05:15:04,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:15:04,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 85 [2025-03-17 05:15:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:04,245 INFO L225 Difference]: With dead ends: 75 [2025-03-17 05:15:04,245 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 05:15:04,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:15:04,251 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:04,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:15:04,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 05:15:04,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 05:15:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:15:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2025-03-17 05:15:04,283 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 85 [2025-03-17 05:15:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:04,283 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2025-03-17 05:15:04,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:15:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2025-03-17 05:15:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 05:15:04,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:04,290 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:04,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:15:04,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:15:04,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:04,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:04,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1283219945, now seen corresponding path program 1 times [2025-03-17 05:15:04,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:04,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786438779] [2025-03-17 05:15:04,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:04,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:04,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 05:15:04,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 05:15:04,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:04,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:15:04,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:04,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786438779] [2025-03-17 05:15:04,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786438779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:15:04,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:15:04,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:15:04,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979818223] [2025-03-17 05:15:04,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:15:04,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:15:04,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:15:04,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:15:04,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:15:04,810 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:15:04,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:04,863 INFO L93 Difference]: Finished difference Result 109 states and 163 transitions. [2025-03-17 05:15:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:15:04,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 85 [2025-03-17 05:15:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:04,866 INFO L225 Difference]: With dead ends: 109 [2025-03-17 05:15:04,866 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 05:15:04,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:15:04,867 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 46 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:04,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 137 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:15:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 05:15:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2025-03-17 05:15:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:15:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 104 transitions. [2025-03-17 05:15:04,889 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 104 transitions. Word has length 85 [2025-03-17 05:15:04,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:04,890 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 104 transitions. [2025-03-17 05:15:04,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:15:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2025-03-17 05:15:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 05:15:04,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:04,891 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:04,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:15:04,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:04,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1122280530, now seen corresponding path program 1 times [2025-03-17 05:15:04,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:04,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386553895] [2025-03-17 05:15:04,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:04,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:04,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:15:04,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:15:04,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:04,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:15:07,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:07,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386553895] [2025-03-17 05:15:07,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386553895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:15:07,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:15:07,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:15:07,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812389730] [2025-03-17 05:15:07,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:15:07,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:15:07,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:15:07,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:15:07,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:15:07,571 INFO L87 Difference]: Start difference. First operand 70 states and 104 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:15:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:08,227 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2025-03-17 05:15:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:15:08,228 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2025-03-17 05:15:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:08,229 INFO L225 Difference]: With dead ends: 122 [2025-03-17 05:15:08,229 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 05:15:08,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:15:08,230 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 99 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:08,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 201 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:15:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 05:15:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2025-03-17 05:15:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:15:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2025-03-17 05:15:08,252 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 86 [2025-03-17 05:15:08,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:08,252 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2025-03-17 05:15:08,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:15:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2025-03-17 05:15:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 05:15:08,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:08,255 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:08,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:15:08,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:08,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:08,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1122250739, now seen corresponding path program 1 times [2025-03-17 05:15:08,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:08,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327387041] [2025-03-17 05:15:08,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:08,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:15:08,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:15:08,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:08,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:15:08,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327387041] [2025-03-17 05:15:08,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327387041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:15:08,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:15:08,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:15:08,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663380651] [2025-03-17 05:15:08,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:15:08,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:15:08,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:15:08,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:15:08,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:15:08,473 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:15:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:08,621 INFO L93 Difference]: Finished difference Result 183 states and 270 transitions. [2025-03-17 05:15:08,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:15:08,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2025-03-17 05:15:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:08,623 INFO L225 Difference]: With dead ends: 183 [2025-03-17 05:15:08,623 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:15:08,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:15:08,624 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 50 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:08,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 213 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:15:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:15:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2025-03-17 05:15:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:15:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2025-03-17 05:15:08,646 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 86 [2025-03-17 05:15:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:08,646 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 157 transitions. [2025-03-17 05:15:08,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:15:08,647 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 157 transitions. [2025-03-17 05:15:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 05:15:08,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:08,649 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:08,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:15:08,649 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:08,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:08,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1951632179, now seen corresponding path program 1 times [2025-03-17 05:15:08,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:08,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696501392] [2025-03-17 05:15:08,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:08,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:08,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:15:08,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:15:08,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:08,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:15:10,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:10,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696501392] [2025-03-17 05:15:10,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696501392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:15:10,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:15:10,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:15:10,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481170696] [2025-03-17 05:15:10,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:15:10,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:15:10,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:15:10,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:15:10,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:15:10,375 INFO L87 Difference]: Start difference. First operand 106 states and 157 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:10,896 INFO L93 Difference]: Finished difference Result 146 states and 208 transitions. [2025-03-17 05:15:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:15:10,896 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2025-03-17 05:15:10,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:10,898 INFO L225 Difference]: With dead ends: 146 [2025-03-17 05:15:10,898 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 05:15:10,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:15:10,899 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 102 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:10,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 228 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:15:10,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 05:15:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 113. [2025-03-17 05:15:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:15:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 169 transitions. [2025-03-17 05:15:10,928 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 169 transitions. Word has length 86 [2025-03-17 05:15:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:10,928 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 169 transitions. [2025-03-17 05:15:10,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:10,931 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 169 transitions. [2025-03-17 05:15:10,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 05:15:10,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:10,934 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:10,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:15:10,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:10,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:10,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1950708658, now seen corresponding path program 1 times [2025-03-17 05:15:10,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:10,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325507941] [2025-03-17 05:15:10,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:10,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:10,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:15:10,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:15:10,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:10,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:15:11,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:11,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325507941] [2025-03-17 05:15:11,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325507941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:15:11,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:15:11,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:15:11,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607952908] [2025-03-17 05:15:11,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:15:11,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:15:11,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:15:11,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:15:11,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:15:11,051 INFO L87 Difference]: Start difference. First operand 113 states and 169 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:11,168 INFO L93 Difference]: Finished difference Result 186 states and 266 transitions. [2025-03-17 05:15:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:15:11,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2025-03-17 05:15:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:11,171 INFO L225 Difference]: With dead ends: 186 [2025-03-17 05:15:11,171 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 05:15:11,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:15:11,172 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 61 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:11,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 142 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:15:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 05:15:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 126. [2025-03-17 05:15:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 77 states have internal predecessors, (93), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:15:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 177 transitions. [2025-03-17 05:15:11,197 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 177 transitions. Word has length 86 [2025-03-17 05:15:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:11,198 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 177 transitions. [2025-03-17 05:15:11,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 177 transitions. [2025-03-17 05:15:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 05:15:11,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:11,200 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:11,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:15:11,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:11,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1923003028, now seen corresponding path program 1 times [2025-03-17 05:15:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:11,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363718519] [2025-03-17 05:15:11,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:11,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:15:11,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:15:11,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:11,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:15:13,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:13,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363718519] [2025-03-17 05:15:13,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363718519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:15:13,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:15:13,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:15:13,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883832230] [2025-03-17 05:15:13,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:15:13,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:15:13,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:15:13,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:15:13,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:15:13,340 INFO L87 Difference]: Start difference. First operand 126 states and 177 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:13,962 INFO L93 Difference]: Finished difference Result 200 states and 275 transitions. [2025-03-17 05:15:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:15:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2025-03-17 05:15:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:13,964 INFO L225 Difference]: With dead ends: 200 [2025-03-17 05:15:13,964 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 05:15:13,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:15:13,965 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 72 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:13,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 242 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:15:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 05:15:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 126. [2025-03-17 05:15:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 77 states have internal predecessors, (93), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:15:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 177 transitions. [2025-03-17 05:15:13,979 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 177 transitions. Word has length 86 [2025-03-17 05:15:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:13,979 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 177 transitions. [2025-03-17 05:15:13,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 177 transitions. [2025-03-17 05:15:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 05:15:13,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:13,980 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:13,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:15:13,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:13,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1922079507, now seen corresponding path program 1 times [2025-03-17 05:15:13,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:13,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107109201] [2025-03-17 05:15:13,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:13,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:15:14,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:15:14,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:14,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:15:18,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:18,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107109201] [2025-03-17 05:15:18,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107109201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:15:18,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:15:18,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:15:18,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479986172] [2025-03-17 05:15:18,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:15:18,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:15:18,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:15:18,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:15:18,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:15:18,853 INFO L87 Difference]: Start difference. First operand 126 states and 177 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:19,255 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2025-03-17 05:15:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:15:19,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2025-03-17 05:15:19,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:19,259 INFO L225 Difference]: With dead ends: 158 [2025-03-17 05:15:19,259 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 05:15:19,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:15:19,260 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 67 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:19,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 261 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:15:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 05:15:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 125. [2025-03-17 05:15:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 76 states have internal predecessors, (91), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:15:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2025-03-17 05:15:19,279 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 86 [2025-03-17 05:15:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:19,279 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2025-03-17 05:15:19,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2025-03-17 05:15:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:15:19,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:19,280 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:19,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:15:19,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:19,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash -368223304, now seen corresponding path program 1 times [2025-03-17 05:15:19,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:19,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596467003] [2025-03-17 05:15:19,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:19,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:19,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:15:19,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:15:19,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:19,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:15:20,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:20,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596467003] [2025-03-17 05:15:20,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596467003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:15:20,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:15:20,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:15:20,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691057675] [2025-03-17 05:15:20,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:15:20,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:15:20,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:15:20,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:15:20,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:15:20,394 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:20,817 INFO L93 Difference]: Finished difference Result 150 states and 203 transitions. [2025-03-17 05:15:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:15:20,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2025-03-17 05:15:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:20,819 INFO L225 Difference]: With dead ends: 150 [2025-03-17 05:15:20,819 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 05:15:20,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:15:20,819 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 60 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:20,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 220 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:15:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 05:15:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2025-03-17 05:15:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.205128205128205) internal successors, (94), 78 states have internal predecessors, (94), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:15:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 178 transitions. [2025-03-17 05:15:20,836 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 178 transitions. Word has length 87 [2025-03-17 05:15:20,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:20,837 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 178 transitions. [2025-03-17 05:15:20,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 178 transitions. [2025-03-17 05:15:20,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:15:20,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:20,837 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:20,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:15:20,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:20,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:20,838 INFO L85 PathProgramCache]: Analyzing trace with hash 519280377, now seen corresponding path program 1 times [2025-03-17 05:15:20,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:20,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550560421] [2025-03-17 05:15:20,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:20,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:20,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:15:20,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:15:20,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:20,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:15:22,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:22,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550560421] [2025-03-17 05:15:22,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550560421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:15:22,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:15:22,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:15:22,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614315521] [2025-03-17 05:15:22,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:15:22,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:15:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:15:22,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:15:22,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:15:22,484 INFO L87 Difference]: Start difference. First operand 127 states and 178 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:22,994 INFO L93 Difference]: Finished difference Result 156 states and 208 transitions. [2025-03-17 05:15:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:15:22,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2025-03-17 05:15:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:22,995 INFO L225 Difference]: With dead ends: 156 [2025-03-17 05:15:22,996 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 05:15:22,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:15:22,996 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 71 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:22,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 243 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:15:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 05:15:23,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 127. [2025-03-17 05:15:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.205128205128205) internal successors, (94), 78 states have internal predecessors, (94), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:15:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 178 transitions. [2025-03-17 05:15:23,008 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 178 transitions. Word has length 87 [2025-03-17 05:15:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:23,008 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 178 transitions. [2025-03-17 05:15:23,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 178 transitions. [2025-03-17 05:15:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:15:23,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:23,009 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:23,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:15:23,009 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:23,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash 547909528, now seen corresponding path program 1 times [2025-03-17 05:15:23,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:23,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567972287] [2025-03-17 05:15:23,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:23,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:23,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:15:23,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:15:23,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:23,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:15:36,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:36,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567972287] [2025-03-17 05:15:36,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567972287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:15:36,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:15:36,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:15:36,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888511211] [2025-03-17 05:15:36,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:15:36,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:15:36,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:15:36,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:15:36,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:15:36,976 INFO L87 Difference]: Start difference. First operand 127 states and 178 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:37,466 INFO L93 Difference]: Finished difference Result 152 states and 204 transitions. [2025-03-17 05:15:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:15:37,466 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2025-03-17 05:15:37,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:37,467 INFO L225 Difference]: With dead ends: 152 [2025-03-17 05:15:37,467 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 05:15:37,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:15:37,468 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 66 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:37,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 241 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:15:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 05:15:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 125. [2025-03-17 05:15:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 76 states have internal predecessors, (91), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:15:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2025-03-17 05:15:37,481 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 87 [2025-03-17 05:15:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:37,481 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2025-03-17 05:15:37,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:15:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2025-03-17 05:15:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 05:15:37,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:37,482 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:37,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:15:37,483 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:37,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:37,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1178876091, now seen corresponding path program 1 times [2025-03-17 05:15:37,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:37,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940741166] [2025-03-17 05:15:37,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:37,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:37,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 05:15:37,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 05:15:37,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:37,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 05:15:45,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:45,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940741166] [2025-03-17 05:15:45,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940741166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:15:45,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396676476] [2025-03-17 05:15:45,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:45,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:15:45,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:15:45,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:15:45,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:15:45,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 05:15:45,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 05:15:45,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:45,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:45,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:15:45,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:15:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 785 proven. 33 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-17 05:15:45,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:15:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 70 proven. 33 refuted. 0 times theorem prover too weak. 1436 trivial. 0 not checked. [2025-03-17 05:15:45,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396676476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:15:45,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:15:45,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2025-03-17 05:15:45,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644438096] [2025-03-17 05:15:45,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:15:45,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:15:45,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:15:45,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:15:45,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:15:45,419 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-17 05:15:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:15:47,257 INFO L93 Difference]: Finished difference Result 257 states and 345 transitions. [2025-03-17 05:15:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 05:15:47,258 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 170 [2025-03-17 05:15:47,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:15:47,259 INFO L225 Difference]: With dead ends: 257 [2025-03-17 05:15:47,259 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 05:15:47,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=357, Invalid=1125, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 05:15:47,260 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 115 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:15:47,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 178 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:15:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 05:15:47,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 136. [2025-03-17 05:15:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 84 states have internal predecessors, (97), 42 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:15:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2025-03-17 05:15:47,275 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 170 [2025-03-17 05:15:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:15:47,276 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2025-03-17 05:15:47,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-03-17 05:15:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2025-03-17 05:15:47,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 05:15:47,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:15:47,277 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:15:47,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:15:47,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 05:15:47,478 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:15:47,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:15:47,479 INFO L85 PathProgramCache]: Analyzing trace with hash 674655613, now seen corresponding path program 1 times [2025-03-17 05:15:47,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:15:47,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187571323] [2025-03-17 05:15:47,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:47,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:15:47,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 05:15:47,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 05:15:47,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:47,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2025-03-17 05:15:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:15:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187571323] [2025-03-17 05:15:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187571323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:15:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945745169] [2025-03-17 05:15:49,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:15:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:15:49,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:15:49,201 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:15:49,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:15:49,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 05:15:49,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 05:15:49,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:15:49,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:15:49,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 05:15:49,286 INFO L279 TraceCheckSpWp]: Computing forward predicates...