./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-59.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 5f6d39be06f72af7d16bb75a603102ae57047b9834b57686fb81555f831b4fac --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:15:28,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:15:28,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:15:28,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:15:28,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:15:28,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:15:28,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:15:28,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:15:28,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:15:28,744 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:15:28,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:15:28,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:15:28,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:15:28,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:15:28,746 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:15:28,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:15:28,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:15:28,746 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 -> 5f6d39be06f72af7d16bb75a603102ae57047b9834b57686fb81555f831b4fac [2025-03-08 13:15:29,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:15:29,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:15:29,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:15:29,031 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:15:29,031 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:15:29,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-59.i [2025-03-08 13:15:30,165 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/436f029bd/90e81be4f9c94256b1d31605d4a50f33/FLAGe6d1d714a [2025-03-08 13:15:30,433 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:15:30,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-59.i [2025-03-08 13:15:30,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/436f029bd/90e81be4f9c94256b1d31605d4a50f33/FLAGe6d1d714a [2025-03-08 13:15:30,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/436f029bd/90e81be4f9c94256b1d31605d4a50f33 [2025-03-08 13:15:30,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:15:30,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:15:30,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:15:30,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:15:30,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:15:30,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50804565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30, skipping insertion in model container [2025-03-08 13:15:30,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:15:30,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-59.i[919,932] [2025-03-08 13:15:30,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:15:30,678 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:15:30,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-59.i[919,932] [2025-03-08 13:15:30,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:15:30,751 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:15:30,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30 WrapperNode [2025-03-08 13:15:30,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:15:30,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:15:30,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:15:30,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:15:30,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,803 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2025-03-08 13:15:30,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:15:30,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:15:30,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:15:30,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:15:30,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,837 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-08 13:15:30,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:15:30,856 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:15:30,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:15:30,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:15:30,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (1/1) ... [2025-03-08 13:15:30,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:15:30,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:15:30,883 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-08 13:15:30,887 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-08 13:15:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:15:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:15:30,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:15:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:15:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:15:30,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:15:30,966 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:15:30,968 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:15:31,359 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 13:15:31,359 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:15:31,369 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:15:31,369 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:15:31,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:15:31 BoogieIcfgContainer [2025-03-08 13:15:31,370 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:15:31,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:15:31,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:15:31,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:15:31,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:15:30" (1/3) ... [2025-03-08 13:15:31,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728fc6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:15:31, skipping insertion in model container [2025-03-08 13:15:31,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:15:30" (2/3) ... [2025-03-08 13:15:31,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728fc6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:15:31, skipping insertion in model container [2025-03-08 13:15:31,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:15:31" (3/3) ... [2025-03-08 13:15:31,378 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-59.i [2025-03-08 13:15:31,389 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:15:31,391 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-59.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:15:31,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:15:31,442 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;@5674f14f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:15:31,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:15:31,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 62 states have internal predecessors, (91), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 13:15:31,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 13:15:31,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:15:31,459 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:15:31,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:15:31,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:15:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1049961034, now seen corresponding path program 1 times [2025-03-08 13:15:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:15:31,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290820628] [2025-03-08 13:15:31,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:15:31,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:15:31,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 13:15:31,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 13:15:31,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:15:31,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:15:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 13:15:31,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:15:31,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290820628] [2025-03-08 13:15:31,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290820628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:15:31,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973155525] [2025-03-08 13:15:31,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:15:31,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:15:31,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:15:31,741 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-08 13:15:31,742 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-08 13:15:31,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 13:15:31,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 13:15:31,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:15:31,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:15:31,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:15:31,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:15:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 13:15:31,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:15:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973155525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:15:31,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:15:31,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:15:31,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343843277] [2025-03-08 13:15:31,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:15:31,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:15:31,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:15:31,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:15:31,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:15:31,980 INFO L87 Difference]: Start difference. First operand has 91 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 62 states have internal predecessors, (91), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 13:15:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:15:32,016 INFO L93 Difference]: Finished difference Result 176 states and 312 transitions. [2025-03-08 13:15:32,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:15:32,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-03-08 13:15:32,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:15:32,023 INFO L225 Difference]: With dead ends: 176 [2025-03-08 13:15:32,024 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 13:15:32,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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-08 13:15:32,029 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:15:32,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:15:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 13:15:32,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-08 13:15:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 13:15:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2025-03-08 13:15:32,068 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 175 [2025-03-08 13:15:32,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:15:32,068 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2025-03-08 13:15:32,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 13:15:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2025-03-08 13:15:32,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 13:15:32,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:15:32,071 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:15:32,079 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-08 13:15:32,272 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-08 13:15:32,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:15:32,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:15:32,273 INFO L85 PathProgramCache]: Analyzing trace with hash -127014095, now seen corresponding path program 1 times [2025-03-08 13:15:32,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:15:32,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413649139] [2025-03-08 13:15:32,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:15:32,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:15:32,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 13:15:32,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 13:15:32,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:15:32,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:15:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:15:32,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:15:32,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413649139] [2025-03-08 13:15:32,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413649139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:15:32,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:15:32,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:15:32,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871071578] [2025-03-08 13:15:32,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:15:32,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:15:32,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:15:32,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:15:32,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:15:32,691 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:15:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:15:32,760 INFO L93 Difference]: Finished difference Result 243 states and 386 transitions. [2025-03-08 13:15:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:15:32,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-08 13:15:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:15:32,764 INFO L225 Difference]: With dead ends: 243 [2025-03-08 13:15:32,764 INFO L226 Difference]: Without dead ends: 158 [2025-03-08 13:15:32,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:15:32,766 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 64 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:15:32,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 256 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:15:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-08 13:15:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2025-03-08 13:15:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 13:15:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 225 transitions. [2025-03-08 13:15:32,791 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 225 transitions. Word has length 175 [2025-03-08 13:15:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:15:32,792 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 225 transitions. [2025-03-08 13:15:32,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:15:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 225 transitions. [2025-03-08 13:15:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 13:15:32,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:15:32,796 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:15:32,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:15:32,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:15:32,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:15:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1815401588, now seen corresponding path program 1 times [2025-03-08 13:15:32,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:15:32,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219813829] [2025-03-08 13:15:32,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:15:32,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:15:32,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 13:15:32,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 13:15:32,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:15:32,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:15:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:15:33,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:15:33,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219813829] [2025-03-08 13:15:33,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219813829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:15:33,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:15:33,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:15:33,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806962271] [2025-03-08 13:15:33,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:15:33,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:15:33,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:15:33,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:15:33,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:15:33,094 INFO L87 Difference]: Start difference. First operand 143 states and 225 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:15:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:15:33,250 INFO L93 Difference]: Finished difference Result 259 states and 408 transitions. [2025-03-08 13:15:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:15:33,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-03-08 13:15:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:15:33,253 INFO L225 Difference]: With dead ends: 259 [2025-03-08 13:15:33,253 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 13:15:33,254 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-08 13:15:33,256 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 108 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:15:33,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 389 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:15:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 13:15:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2025-03-08 13:15:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 13:15:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 243 transitions. [2025-03-08 13:15:33,281 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 243 transitions. Word has length 177 [2025-03-08 13:15:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:15:33,281 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 243 transitions. [2025-03-08 13:15:33,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:15:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 243 transitions. [2025-03-08 13:15:33,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 13:15:33,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:15:33,283 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:15:33,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:15:33,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:15:33,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:15:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1523271569, now seen corresponding path program 1 times [2025-03-08 13:15:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:15:33,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284418590] [2025-03-08 13:15:33,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:15:33,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:15:33,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 13:15:33,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 13:15:33,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:15:33,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:15:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:15:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:15:33,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284418590] [2025-03-08 13:15:33,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284418590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:15:33,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:15:33,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:15:33,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914725020] [2025-03-08 13:15:33,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:15:33,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:15:33,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:15:33,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:15:33,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:15:33,627 INFO L87 Difference]: Start difference. First operand 155 states and 243 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:15:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:15:33,732 INFO L93 Difference]: Finished difference Result 261 states and 412 transitions. [2025-03-08 13:15:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:15:33,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2025-03-08 13:15:33,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:15:33,735 INFO L225 Difference]: With dead ends: 261 [2025-03-08 13:15:33,735 INFO L226 Difference]: Without dead ends: 161 [2025-03-08 13:15:33,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:15:33,736 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 65 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:15:33,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 228 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:15:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-08 13:15:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2025-03-08 13:15:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 13:15:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 241 transitions. [2025-03-08 13:15:33,766 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 241 transitions. Word has length 178 [2025-03-08 13:15:33,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:15:33,766 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 241 transitions. [2025-03-08 13:15:33,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:15:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 241 transitions. [2025-03-08 13:15:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 13:15:33,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:15:33,769 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:15:33,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:15:33,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:15:33,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:15:33,770 INFO L85 PathProgramCache]: Analyzing trace with hash -683913220, now seen corresponding path program 1 times [2025-03-08 13:15:33,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:15:33,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671634453] [2025-03-08 13:15:33,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:15:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:15:33,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 13:15:33,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 13:15:33,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:15:33,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:15:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:15:34,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:15:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671634453] [2025-03-08 13:15:34,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671634453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:15:34,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:15:34,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 13:15:34,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481218123] [2025-03-08 13:15:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:15:34,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 13:15:34,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:15:34,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 13:15:34,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:15:34,190 INFO L87 Difference]: Start difference. First operand 155 states and 241 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 13:15:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:15:34,532 INFO L93 Difference]: Finished difference Result 335 states and 523 transitions. [2025-03-08 13:15:34,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:15:34,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 180 [2025-03-08 13:15:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:15:34,536 INFO L225 Difference]: With dead ends: 335 [2025-03-08 13:15:34,536 INFO L226 Difference]: Without dead ends: 250 [2025-03-08 13:15:34,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:15:34,537 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 237 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:15:34,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 702 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:15:34,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-08 13:15:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2025-03-08 13:15:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 153 states have (on average 1.3790849673202614) internal successors, (211), 153 states have internal predecessors, (211), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 13:15:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 373 transitions. [2025-03-08 13:15:34,578 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 373 transitions. Word has length 180 [2025-03-08 13:15:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:15:34,578 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 373 transitions. [2025-03-08 13:15:34,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 13:15:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 373 transitions. [2025-03-08 13:15:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 13:15:34,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:15:34,580 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:15:34,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 13:15:34,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:15:34,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:15:34,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1252879159, now seen corresponding path program 1 times [2025-03-08 13:15:34,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:15:34,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817481177] [2025-03-08 13:15:34,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:15:34,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:15:34,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 13:15:34,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 13:15:34,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:15:34,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:15:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:15:34,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:15:34,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817481177] [2025-03-08 13:15:34,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817481177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:15:34,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:15:34,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 13:15:34,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256521266] [2025-03-08 13:15:34,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:15:34,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:15:34,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:15:34,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:15:34,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:15:34,883 INFO L87 Difference]: Start difference. First operand 238 states and 373 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:15:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:15:35,129 INFO L93 Difference]: Finished difference Result 601 states and 951 transitions. [2025-03-08 13:15:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:15:35,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-03-08 13:15:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:15:35,133 INFO L225 Difference]: With dead ends: 601 [2025-03-08 13:15:35,134 INFO L226 Difference]: Without dead ends: 427 [2025-03-08 13:15:35,135 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-08 13:15:35,136 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 148 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:15:35,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 396 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:15:35,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-08 13:15:35,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 362. [2025-03-08 13:15:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 221 states have (on average 1.3484162895927603) internal successors, (298), 221 states have internal predecessors, (298), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 13:15:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 568 transitions. [2025-03-08 13:15:35,190 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 568 transitions. Word has length 181 [2025-03-08 13:15:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:15:35,190 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 568 transitions. [2025-03-08 13:15:35,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:15:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 568 transitions. [2025-03-08 13:15:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 13:15:35,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:15:35,191 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:15:35,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 13:15:35,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:15:35,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:15:35,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2045015784, now seen corresponding path program 1 times [2025-03-08 13:15:35,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:15:35,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674924635] [2025-03-08 13:15:35,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:15:35,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:15:35,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 13:15:35,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 13:15:35,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:15:35,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:15:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:15:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:15:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674924635] [2025-03-08 13:15:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674924635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:15:35,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:15:35,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:15:35,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284154158] [2025-03-08 13:15:35,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:15:35,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:15:35,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:15:35,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:15:35,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:15:35,419 INFO L87 Difference]: Start difference. First operand 362 states and 568 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:15:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:15:35,574 INFO L93 Difference]: Finished difference Result 663 states and 1044 transitions. [2025-03-08 13:15:35,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:15:35,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-03-08 13:15:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:15:35,579 INFO L225 Difference]: With dead ends: 663 [2025-03-08 13:15:35,579 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 13:15:35,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-08 13:15:35,580 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 61 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:15:35,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 354 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:15:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 13:15:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 360. [2025-03-08 13:15:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 219 states have (on average 1.3424657534246576) internal successors, (294), 219 states have internal predecessors, (294), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 13:15:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 564 transitions. [2025-03-08 13:15:35,616 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 564 transitions. Word has length 181 [2025-03-08 13:15:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:15:35,617 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 564 transitions. [2025-03-08 13:15:35,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:15:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 564 transitions. [2025-03-08 13:15:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 13:15:35,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:15:35,618 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:15:35,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 13:15:35,618 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:15:35,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:15:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2095871017, now seen corresponding path program 1 times [2025-03-08 13:15:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:15:35,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114127784] [2025-03-08 13:15:35,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:15:35,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:15:35,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 13:15:35,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 13:15:35,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:15:35,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:15:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-08 13:15:36,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:15:36,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114127784] [2025-03-08 13:15:36,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114127784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:15:36,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67071072] [2025-03-08 13:15:36,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:15:36,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:15:36,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:15:36,095 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-08 13:15:36,096 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-08 13:15:36,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 13:15:36,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 13:15:36,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:15:36,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:15:36,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 13:15:36,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:15:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2025-03-08 13:15:37,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:15:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-08 13:15:38,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67071072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:15:38,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:15:38,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 22 [2025-03-08 13:15:38,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611189520] [2025-03-08 13:15:38,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:15:38,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 13:15:38,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:15:38,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 13:15:38,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-08 13:15:38,004 INFO L87 Difference]: Start difference. First operand 360 states and 564 transitions. Second operand has 22 states, 22 states have (on average 6.136363636363637) internal successors, (135), 22 states have internal predecessors, (135), 6 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 6 states have call predecessors, (81), 6 states have call successors, (81) [2025-03-08 13:15:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:15:39,214 INFO L93 Difference]: Finished difference Result 771 states and 1177 transitions. [2025-03-08 13:15:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 13:15:39,217 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.136363636363637) internal successors, (135), 22 states have internal predecessors, (135), 6 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 6 states have call predecessors, (81), 6 states have call successors, (81) Word has length 182 [2025-03-08 13:15:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:15:39,220 INFO L225 Difference]: With dead ends: 771 [2025-03-08 13:15:39,220 INFO L226 Difference]: Without dead ends: 481 [2025-03-08 13:15:39,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=355, Invalid=1285, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 13:15:39,225 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 653 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 13:15:39,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 782 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 13:15:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-08 13:15:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 431. [2025-03-08 13:15:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 273 states have (on average 1.3113553113553114) internal successors, (358), 277 states have internal predecessors, (358), 147 states have call successors, (147), 10 states have call predecessors, (147), 10 states have return successors, (147), 143 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-08 13:15:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 652 transitions. [2025-03-08 13:15:39,282 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 652 transitions. Word has length 182 [2025-03-08 13:15:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:15:39,283 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 652 transitions. [2025-03-08 13:15:39,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.136363636363637) internal successors, (135), 22 states have internal predecessors, (135), 6 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 6 states have call predecessors, (81), 6 states have call successors, (81) [2025-03-08 13:15:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 652 transitions. [2025-03-08 13:15:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 13:15:39,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:15:39,284 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:15:39,292 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-08 13:15:39,485 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,SelfDestructingSolverStorable7 [2025-03-08 13:15:39,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:15:39,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:15:39,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1802468010, now seen corresponding path program 1 times [2025-03-08 13:15:39,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:15:39,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882245098] [2025-03-08 13:15:39,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:15:39,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:15:39,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 13:15:39,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 13:15:39,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:15:39,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:15:39,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903127703] [2025-03-08 13:15:39,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:15:39,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:15:39,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:15:39,609 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-08 13:15:39,611 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-08 13:15:39,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 13:15:39,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 13:15:39,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:15:39,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:15:39,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 13:15:39,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:15:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 338 proven. 300 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-08 13:15:41,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:15:55,297 WARN L286 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:16:07,086 WARN L286 SmtUtils]: Spent 7.16s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)