./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.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-pr-cn_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 366cd04e1cccaa3d248693408475f1d8f6198ae7da412e5cc3eb2ead8f221652 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:29:52,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:29:52,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:29:52,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:29:52,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:29:52,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:29:52,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:29:52,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:29:52,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:29:52,669 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:29:52,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:29:52,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:29:52,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:29:52,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:29:52,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:29:52,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:29:52,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:29:52,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:29:52,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:29:52,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:29:52,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:29:52,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:29:52,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:29:52,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:29:52,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:29:52,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:29:52,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:29:52,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:29:52,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:29:52,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:29:52,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:29:52,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:29:52,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:29:52,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:29:52,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:29:52,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:29:52,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:29:52,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:29:52,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:29:52,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:29:52,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:29:52,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:29:52,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:29:52,673 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 -> 366cd04e1cccaa3d248693408475f1d8f6198ae7da412e5cc3eb2ead8f221652 [2025-03-08 12:29:52,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:29:52,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:29:52,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:29:52,916 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:29:52,916 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:29:52,917 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-pr-cn_file-66.i [2025-03-08 12:29:54,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc5a31f7/b67632b7dad74a368620c0767f59ca36/FLAG453e20d5d [2025-03-08 12:29:54,303 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:29:54,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i [2025-03-08 12:29:54,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc5a31f7/b67632b7dad74a368620c0767f59ca36/FLAG453e20d5d [2025-03-08 12:29:54,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc5a31f7/b67632b7dad74a368620c0767f59ca36 [2025-03-08 12:29:54,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:29:54,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:29:54,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:29:54,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:29:54,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:29:54,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54, skipping insertion in model container [2025-03-08 12:29:54,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:29:54,766 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-pr-cn_file-66.i[919,932] [2025-03-08 12:29:54,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:29:54,850 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:29:54,860 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-pr-cn_file-66.i[919,932] [2025-03-08 12:29:54,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:29:54,909 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:29:54,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54 WrapperNode [2025-03-08 12:29:54,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:29:54,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:29:54,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:29:54,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:29:54,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,939 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2025-03-08 12:29:54,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:29:54,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:29:54,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:29:54,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:29:54,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,959 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 12:29:54,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,966 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:29:54,976 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:29:54,976 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:29:54,976 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:29:54,977 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (1/1) ... [2025-03-08 12:29:54,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:29:54,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:29:55,007 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 12:29:55,010 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 12:29:55,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:29:55,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:29:55,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:29:55,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:29:55,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:29:55,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:29:55,097 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:29:55,099 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:29:55,400 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 12:29:55,401 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:29:55,411 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:29:55,412 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:29:55,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:29:55 BoogieIcfgContainer [2025-03-08 12:29:55,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:29:55,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:29:55,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:29:55,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:29:55,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:29:54" (1/3) ... [2025-03-08 12:29:55,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc74457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:29:55, skipping insertion in model container [2025-03-08 12:29:55,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:54" (2/3) ... [2025-03-08 12:29:55,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc74457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:29:55, skipping insertion in model container [2025-03-08 12:29:55,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:29:55" (3/3) ... [2025-03-08 12:29:55,422 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i [2025-03-08 12:29:55,433 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:29:55,435 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:29:55,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:29:55,488 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;@65e9585c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:29:55,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:29:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 12:29:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 12:29:55,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:29:55,505 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:29:55,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:29:55,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:29:55,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1612159271, now seen corresponding path program 1 times [2025-03-08 12:29:55,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:29:55,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-03-08 12:29:55,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:29:55,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:29:55,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 12:29:55,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 12:29:55,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:29:55,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:29:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-03-08 12:29:55,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:29:55,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-03-08 12:29:55,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452617232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:29:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610106869] [2025-03-08 12:29:55,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:29:55,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:29:55,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:29:55,850 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 12:29:55,851 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 12:29:55,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 12:29:55,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 12:29:55,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:29:55,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:29:55,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:29:55,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:29:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-03-08 12:29:56,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:29:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610106869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:29:56,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:29:56,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:29:56,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438688333] [2025-03-08 12:29:56,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:29:56,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:29:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:29:56,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:29:56,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:29:56,044 INFO L87 Difference]: Start difference. First operand has 113 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-08 12:29:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:29:56,067 INFO L93 Difference]: Finished difference Result 220 states and 401 transitions. [2025-03-08 12:29:56,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:29:56,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 270 [2025-03-08 12:29:56,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:29:56,073 INFO L225 Difference]: With dead ends: 220 [2025-03-08 12:29:56,073 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 12:29:56,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 271 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 12:29:56,079 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:29:56,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:29:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 12:29:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 12:29:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 12:29:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 176 transitions. [2025-03-08 12:29:56,112 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 176 transitions. Word has length 270 [2025-03-08 12:29:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:29:56,112 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 176 transitions. [2025-03-08 12:29:56,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-08 12:29:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 176 transitions. [2025-03-08 12:29:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 12:29:56,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:29:56,115 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:29:56,123 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 12:29:56,320 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 12:29:56,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:29:56,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:29:56,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1390424187, now seen corresponding path program 1 times [2025-03-08 12:29:56,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:29:56,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079456035] [2025-03-08 12:29:56,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:29:56,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:29:56,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 12:29:56,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 12:29:56,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:29:56,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:30:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-08 12:30:00,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:30:00,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079456035] [2025-03-08 12:30:00,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079456035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:30:00,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:30:00,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 12:30:00,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603944228] [2025-03-08 12:30:00,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:30:00,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 12:30:00,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:30:00,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 12:30:00,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:30:00,888 INFO L87 Difference]: Start difference. First operand 110 states and 176 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:30:01,672 INFO L93 Difference]: Finished difference Result 378 states and 585 transitions. [2025-03-08 12:30:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 12:30:01,673 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-08 12:30:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:30:01,675 INFO L225 Difference]: With dead ends: 378 [2025-03-08 12:30:01,675 INFO L226 Difference]: Without dead ends: 271 [2025-03-08 12:30:01,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-08 12:30:01,677 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 269 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:30:01,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1095 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:30:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-08 12:30:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 180. [2025-03-08 12:30:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 129 states have (on average 1.4883720930232558) internal successors, (192), 130 states have internal predecessors, (192), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 12:30:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 288 transitions. [2025-03-08 12:30:01,710 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 288 transitions. Word has length 270 [2025-03-08 12:30:01,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:30:01,711 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 288 transitions. [2025-03-08 12:30:01,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 288 transitions. [2025-03-08 12:30:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 12:30:01,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:30:01,716 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:30:01,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:30:01,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:30:01,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:30:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1389500666, now seen corresponding path program 1 times [2025-03-08 12:30:01,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:30:01,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287854478] [2025-03-08 12:30:01,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:30:01,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:30:01,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 12:30:01,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 12:30:01,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:30:01,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:30:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-08 12:30:31,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:30:31,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287854478] [2025-03-08 12:30:31,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287854478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:30:31,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:30:31,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 12:30:31,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465040743] [2025-03-08 12:30:31,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:30:31,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 12:30:31,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:30:31,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 12:30:31,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:30:31,752 INFO L87 Difference]: Start difference. First operand 180 states and 288 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:33,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:30:33,037 INFO L93 Difference]: Finished difference Result 245 states and 375 transitions. [2025-03-08 12:30:33,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 12:30:33,038 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-08 12:30:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:30:33,041 INFO L225 Difference]: With dead ends: 245 [2025-03-08 12:30:33,041 INFO L226 Difference]: Without dead ends: 243 [2025-03-08 12:30:33,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:30:33,042 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 199 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:30:33,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1148 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:30:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-08 12:30:33,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 181. [2025-03-08 12:30:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 130 states have (on average 1.4846153846153847) internal successors, (193), 131 states have internal predecessors, (193), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 12:30:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 289 transitions. [2025-03-08 12:30:33,069 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 289 transitions. Word has length 270 [2025-03-08 12:30:33,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:30:33,070 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 289 transitions. [2025-03-08 12:30:33,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2025-03-08 12:30:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 12:30:33,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:30:33,075 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:30:33,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:30:33,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:30:33,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:30:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1261341468, now seen corresponding path program 1 times [2025-03-08 12:30:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:30:33,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235187781] [2025-03-08 12:30:33,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:30:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:30:33,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 12:30:33,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 12:30:33,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:30:33,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:30:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-08 12:30:36,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:30:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235187781] [2025-03-08 12:30:36,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235187781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:30:36,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:30:36,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 12:30:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96283529] [2025-03-08 12:30:36,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:30:36,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 12:30:36,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:30:36,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 12:30:36,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:30:36,370 INFO L87 Difference]: Start difference. First operand 181 states and 289 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:30:37,118 INFO L93 Difference]: Finished difference Result 271 states and 404 transitions. [2025-03-08 12:30:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 12:30:37,119 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-08 12:30:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:30:37,120 INFO L225 Difference]: With dead ends: 271 [2025-03-08 12:30:37,121 INFO L226 Difference]: Without dead ends: 269 [2025-03-08 12:30:37,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-08 12:30:37,121 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 264 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:30:37,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1382 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:30:37,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-08 12:30:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 189. [2025-03-08 12:30:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 138 states have (on average 1.4927536231884058) internal successors, (206), 139 states have internal predecessors, (206), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 12:30:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 302 transitions. [2025-03-08 12:30:37,135 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 302 transitions. Word has length 270 [2025-03-08 12:30:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:30:37,136 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 302 transitions. [2025-03-08 12:30:37,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 302 transitions. [2025-03-08 12:30:37,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 12:30:37,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:30:37,138 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:30:37,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:30:37,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:30:37,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:30:37,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1260417947, now seen corresponding path program 1 times [2025-03-08 12:30:37,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:30:37,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241948611] [2025-03-08 12:30:37,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:30:37,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:30:37,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 12:30:37,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 12:30:37,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:30:37,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:30:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-08 12:30:41,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:30:41,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241948611] [2025-03-08 12:30:41,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241948611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:30:41,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:30:41,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 12:30:41,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720797535] [2025-03-08 12:30:41,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:30:41,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 12:30:41,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:30:41,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 12:30:41,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:30:41,571 INFO L87 Difference]: Start difference. First operand 189 states and 302 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:30:42,496 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions. [2025-03-08 12:30:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 12:30:42,497 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-08 12:30:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:30:42,499 INFO L225 Difference]: With dead ends: 269 [2025-03-08 12:30:42,499 INFO L226 Difference]: Without dead ends: 267 [2025-03-08 12:30:42,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:30:42,500 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 290 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:30:42,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1293 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:30:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-08 12:30:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 185. [2025-03-08 12:30:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 134 states have (on average 1.492537313432836) internal successors, (200), 135 states have internal predecessors, (200), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 12:30:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 296 transitions. [2025-03-08 12:30:42,512 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 296 transitions. Word has length 270 [2025-03-08 12:30:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:30:42,512 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 296 transitions. [2025-03-08 12:30:42,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 296 transitions. [2025-03-08 12:30:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 12:30:42,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:30:42,516 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:30:42,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:30:42,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:30:42,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:30:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1900958364, now seen corresponding path program 1 times [2025-03-08 12:30:42,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:30:42,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394565050] [2025-03-08 12:30:42,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:30:42,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:30:42,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 12:30:42,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 12:30:42,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:30:42,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:30:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-08 12:30:42,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:30:42,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394565050] [2025-03-08 12:30:42,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394565050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:30:42,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:30:42,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:30:42,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631997958] [2025-03-08 12:30:42,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:30:42,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:30:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:30:42,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:30:42,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:30:42,623 INFO L87 Difference]: Start difference. First operand 185 states and 296 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:30:42,667 INFO L93 Difference]: Finished difference Result 513 states and 824 transitions. [2025-03-08 12:30:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:30:42,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-08 12:30:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:30:42,670 INFO L225 Difference]: With dead ends: 513 [2025-03-08 12:30:42,673 INFO L226 Difference]: Without dead ends: 331 [2025-03-08 12:30:42,674 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 12:30:42,674 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 162 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:30:42,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 492 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:30:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-08 12:30:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2025-03-08 12:30:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 228 states have (on average 1.4385964912280702) internal successors, (328), 230 states have internal predecessors, (328), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 94 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 12:30:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 520 transitions. [2025-03-08 12:30:42,705 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 520 transitions. Word has length 270 [2025-03-08 12:30:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:30:42,705 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 520 transitions. [2025-03-08 12:30:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2025-03-08 12:30:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 12:30:42,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:30:42,709 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:30:42,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:30:42,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:30:42,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:30:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash 597057573, now seen corresponding path program 1 times [2025-03-08 12:30:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:30:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173281431] [2025-03-08 12:30:42,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:30:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:30:42,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 12:30:42,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 12:30:42,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:30:42,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:30:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-08 12:30:42,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:30:42,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173281431] [2025-03-08 12:30:42,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173281431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:30:42,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:30:42,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:30:42,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158627941] [2025-03-08 12:30:42,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:30:42,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:30:42,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:30:42,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:30:42,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:30:42,820 INFO L87 Difference]: Start difference. First operand 329 states and 520 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:30:43,069 INFO L93 Difference]: Finished difference Result 957 states and 1498 transitions. [2025-03-08 12:30:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:30:43,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-08 12:30:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:30:43,077 INFO L225 Difference]: With dead ends: 957 [2025-03-08 12:30:43,077 INFO L226 Difference]: Without dead ends: 631 [2025-03-08 12:30:43,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:30:43,079 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 127 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:30:43,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 564 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:30:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-08 12:30:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 580. [2025-03-08 12:30:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 383 states have (on average 1.4099216710182767) internal successors, (540), 386 states have internal predecessors, (540), 188 states have call successors, (188), 8 states have call predecessors, (188), 8 states have return successors, (188), 185 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-08 12:30:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 916 transitions. [2025-03-08 12:30:43,132 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 916 transitions. Word has length 270 [2025-03-08 12:30:43,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:30:43,133 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 916 transitions. [2025-03-08 12:30:43,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 916 transitions. [2025-03-08 12:30:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 12:30:43,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:30:43,134 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:30:43,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:30:43,135 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:30:43,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:30:43,135 INFO L85 PathProgramCache]: Analyzing trace with hash 726140292, now seen corresponding path program 1 times [2025-03-08 12:30:43,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:30:43,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89254262] [2025-03-08 12:30:43,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:30:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:30:43,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 12:30:43,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 12:30:43,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:30:43,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:30:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-08 12:30:45,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:30:45,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89254262] [2025-03-08 12:30:45,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89254262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:30:45,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:30:45,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 12:30:45,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130601039] [2025-03-08 12:30:45,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:30:45,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 12:30:45,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:30:45,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 12:30:45,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-08 12:30:45,372 INFO L87 Difference]: Start difference. First operand 580 states and 916 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:30:46,184 INFO L93 Difference]: Finished difference Result 749 states and 1124 transitions. [2025-03-08 12:30:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 12:30:46,185 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-08 12:30:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:30:46,189 INFO L225 Difference]: With dead ends: 749 [2025-03-08 12:30:46,189 INFO L226 Difference]: Without dead ends: 747 [2025-03-08 12:30:46,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:30:46,190 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 423 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:30:46,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1085 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:30:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-08 12:30:46,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 651. [2025-03-08 12:30:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 443 states have (on average 1.399548532731377) internal successors, (620), 448 states have internal predecessors, (620), 196 states have call successors, (196), 11 states have call predecessors, (196), 11 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-08 12:30:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1012 transitions. [2025-03-08 12:30:46,252 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1012 transitions. Word has length 270 [2025-03-08 12:30:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:30:46,253 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 1012 transitions. [2025-03-08 12:30:46,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-08 12:30:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1012 transitions. [2025-03-08 12:30:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 12:30:46,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:30:46,256 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:30:46,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:30:46,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:30:46,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:30:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash 727063813, now seen corresponding path program 1 times [2025-03-08 12:30:46,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:30:46,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703805493] [2025-03-08 12:30:46,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:30:46,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:30:46,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 12:30:46,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 12:30:46,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:30:46,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:30:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-08 12:30:49,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:30:49,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703805493] [2025-03-08 12:30:49,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703805493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:30:49,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:30:49,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 12:30:49,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435194580] [2025-03-08 12:30:49,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:30:49,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 12:30:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:30:49,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 12:30:49,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:30:49,831 INFO L87 Difference]: Start difference. First operand 651 states and 1012 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-03-08 12:30:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:30:52,683 INFO L93 Difference]: Finished difference Result 747 states and 1122 transitions. [2025-03-08 12:30:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 12:30:52,684 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 270 [2025-03-08 12:30:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:30:52,687 INFO L225 Difference]: With dead ends: 747 [2025-03-08 12:30:52,688 INFO L226 Difference]: Without dead ends: 745 [2025-03-08 12:30:52,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=228, Invalid=474, Unknown=0, NotChecked=0, Total=702 [2025-03-08 12:30:52,689 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 474 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 12:30:52,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1294 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 12:30:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-08 12:30:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 651. [2025-03-08 12:30:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 443 states have (on average 1.399548532731377) internal successors, (620), 448 states have internal predecessors, (620), 196 states have call successors, (196), 11 states have call predecessors, (196), 11 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-08 12:30:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1012 transitions. [2025-03-08 12:30:52,749 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1012 transitions. Word has length 270 [2025-03-08 12:30:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:30:52,750 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 1012 transitions. [2025-03-08 12:30:52,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-03-08 12:30:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1012 transitions. [2025-03-08 12:30:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 12:30:52,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:30:52,752 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:30:52,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 12:30:52,752 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:30:52,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:30:52,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2060071238, now seen corresponding path program 1 times [2025-03-08 12:30:52,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:30:52,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56607740] [2025-03-08 12:30:52,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:30:52,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:30:52,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 12:30:52,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 12:30:52,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:30:52,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:30:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-08 12:30:53,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:30:53,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56607740] [2025-03-08 12:30:53,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56607740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:30:53,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:30:53,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:30:53,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215981291] [2025-03-08 12:30:53,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:30:53,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:30:53,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:30:53,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:30:53,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:30:53,084 INFO L87 Difference]: Start difference. First operand 651 states and 1012 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-08 12:30:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:30:53,382 INFO L93 Difference]: Finished difference Result 1197 states and 1843 transitions. [2025-03-08 12:30:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:30:53,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 270 [2025-03-08 12:30:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:30:53,389 INFO L225 Difference]: With dead ends: 1197 [2025-03-08 12:30:53,389 INFO L226 Difference]: Without dead ends: 638 [2025-03-08 12:30:53,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:30:53,393 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 222 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:30:53,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 332 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:30:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-08 12:30:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 623. [2025-03-08 12:30:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 409 states have (on average 1.3471882640586796) internal successors, (551), 414 states have internal predecessors, (551), 200 states have call successors, (200), 13 states have call predecessors, (200), 13 states have return successors, (200), 195 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-08 12:30:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 951 transitions. [2025-03-08 12:30:53,444 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 951 transitions. Word has length 270 [2025-03-08 12:30:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:30:53,445 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 951 transitions. [2025-03-08 12:30:53,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-08 12:30:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 951 transitions. [2025-03-08 12:30:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-08 12:30:53,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:30:53,446 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:30:53,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 12:30:53,447 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:30:53,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:30:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2773143, now seen corresponding path program 1 times [2025-03-08 12:30:53,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:30:53,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828381607] [2025-03-08 12:30:53,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:30:53,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:30:53,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-08 12:30:53,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-08 12:30:53,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:30:53,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:30:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 84 proven. 45 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-03-08 12:30:57,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:30:57,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828381607] [2025-03-08 12:30:57,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828381607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:30:57,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723923394] [2025-03-08 12:30:57,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:30:57,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:30:57,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:30:57,720 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 12:30:57,721 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 12:30:57,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-08 12:30:57,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-08 12:30:57,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:30:57,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:30:57,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 12:30:57,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:30:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1796 proven. 84 refuted. 0 times theorem prover too weak. 1904 trivial. 0 not checked. [2025-03-08 12:30:58,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:30:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 168 proven. 87 refuted. 0 times theorem prover too weak. 3529 trivial. 0 not checked. [2025-03-08 12:30:59,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723923394] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:30:59,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:30:59,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 26 [2025-03-08 12:30:59,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281244796] [2025-03-08 12:30:59,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:30:59,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 12:30:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:30:59,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 12:30:59,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2025-03-08 12:30:59,218 INFO L87 Difference]: Start difference. First operand 623 states and 951 transitions. Second operand has 26 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 12 states have call successors, (132), 4 states have call predecessors, (132), 8 states have return successors, (132), 11 states have call predecessors, (132), 12 states have call successors, (132) [2025-03-08 12:31:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:31:02,354 INFO L93 Difference]: Finished difference Result 2385 states and 3530 transitions. [2025-03-08 12:31:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 12:31:02,354 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 12 states have call successors, (132), 4 states have call predecessors, (132), 8 states have return successors, (132), 11 states have call predecessors, (132), 12 states have call successors, (132) Word has length 271 [2025-03-08 12:31:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:31:02,364 INFO L225 Difference]: With dead ends: 2385 [2025-03-08 12:31:02,364 INFO L226 Difference]: Without dead ends: 1849 [2025-03-08 12:31:02,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=660, Invalid=2202, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 12:31:02,368 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 845 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 808 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 808 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:31:02,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1439 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [808 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 12:31:02,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2025-03-08 12:31:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 925. [2025-03-08 12:31:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 613 states have (on average 1.298531810766721) internal successors, (796), 626 states have internal predecessors, (796), 284 states have call successors, (284), 27 states have call predecessors, (284), 27 states have return successors, (284), 271 states have call predecessors, (284), 284 states have call successors, (284) [2025-03-08 12:31:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1364 transitions. [2025-03-08 12:31:02,502 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1364 transitions. Word has length 271 [2025-03-08 12:31:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:31:02,503 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1364 transitions. [2025-03-08 12:31:02,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 12 states have call successors, (132), 4 states have call predecessors, (132), 8 states have return successors, (132), 11 states have call predecessors, (132), 12 states have call successors, (132) [2025-03-08 12:31:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1364 transitions. [2025-03-08 12:31:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 12:31:02,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:31:02,505 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:02,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 12:31:02,705 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,SelfDestructingSolverStorable10 [2025-03-08 12:31:02,706 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:31:02,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:31:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash -702997504, now seen corresponding path program 1 times [2025-03-08 12:31:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:31:02,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94424565] [2025-03-08 12:31:02,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:31:02,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:31:02,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 12:31:02,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 12:31:02,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:31:02,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:31:02,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312883516] [2025-03-08 12:31:02,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:31:02,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:31:02,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:31:02,754 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 12:31:02,757 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 12:31:02,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 12:31:02,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 12:31:02,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:31:02,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:31:02,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 12:31:02,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:31:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1143 proven. 504 refuted. 0 times theorem prover too weak. 2137 trivial. 0 not checked. [2025-03-08 12:31:09,620 INFO L312 TraceCheckSpWp]: Computing backward predicates...