./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-ci_file-10.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 69eea854146ed6719c2a02b1e3c48ec2ec3340ce1e8957b9754599908f0bff1b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:59:43,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:59:44,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:59:44,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:59:44,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:59:44,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:59:44,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:59:44,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:59:44,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:59:44,081 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:59:44,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:59:44,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:59:44,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:59:44,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:59:44,082 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:59:44,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:59:44,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:59:44,083 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:59:44,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:59:44,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:59:44,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:59:44,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:59:44,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:59:44,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:59:44,084 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:59:44,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:59:44,084 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:59:44,084 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:59:44,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:59:44,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:59:44,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:59:44,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:59:44,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:59:44,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:59:44,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:59:44,085 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:59:44,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:59:44,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:59:44,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:59:44,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:59:44,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:59:44,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:59:44,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:59:44,086 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 -> 69eea854146ed6719c2a02b1e3c48ec2ec3340ce1e8957b9754599908f0bff1b [2025-03-03 20:59:44,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:59:44,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:59:44,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:59:44,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:59:44,320 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:59:44,321 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-ci_file-10.i [2025-03-03 20:59:45,471 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615b949b7/79f6c5c8260e4ff4b957217cbb0931d5/FLAG6624137a9 [2025-03-03 20:59:45,776 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:59:45,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i [2025-03-03 20:59:45,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615b949b7/79f6c5c8260e4ff4b957217cbb0931d5/FLAG6624137a9 [2025-03-03 20:59:46,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615b949b7/79f6c5c8260e4ff4b957217cbb0931d5 [2025-03-03 20:59:46,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:59:46,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:59:46,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:59:46,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:59:46,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:59:46,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c75fcdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46, skipping insertion in model container [2025-03-03 20:59:46,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:59:46,192 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-ci_file-10.i[919,932] [2025-03-03 20:59:46,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:59:46,294 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:59:46,302 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-ci_file-10.i[919,932] [2025-03-03 20:59:46,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:59:46,359 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:59:46,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46 WrapperNode [2025-03-03 20:59:46,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:59:46,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:59:46,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:59:46,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:59:46,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,418 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 295 [2025-03-03 20:59:46,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:59:46,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:59:46,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:59:46,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:59:46,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,455 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-03 20:59:46,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,471 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:59:46,490 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:59:46,490 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:59:46,490 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:59:46,491 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (1/1) ... [2025-03-03 20:59:46,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:59:46,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:59:46,523 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-03 20:59:46,525 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-03 20:59:46,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:59:46,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:59:46,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:59:46,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:59:46,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:59:46,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:59:46,612 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:59:46,614 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:59:46,971 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~bitwise32#1;havoc property_#t~ite34#1;havoc property_#t~bitwise33#1;havoc property_#t~short35#1; [2025-03-03 20:59:47,004 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-03 20:59:47,004 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:59:47,024 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:59:47,024 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:59:47,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:59:47 BoogieIcfgContainer [2025-03-03 20:59:47,024 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:59:47,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:59:47,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:59:47,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:59:47,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:59:46" (1/3) ... [2025-03-03 20:59:47,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b275ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:59:47, skipping insertion in model container [2025-03-03 20:59:47,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:46" (2/3) ... [2025-03-03 20:59:47,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b275ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:59:47, skipping insertion in model container [2025-03-03 20:59:47,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:59:47" (3/3) ... [2025-03-03 20:59:47,033 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i [2025-03-03 20:59:47,045 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:59:47,049 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:59:47,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:59:47,127 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;@977e932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:59:47,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:59:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 89 states have internal predecessors, (127), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 20:59:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:59:47,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:47,146 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:59:47,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:47,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:47,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1820840392, now seen corresponding path program 1 times [2025-03-03 20:59:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:47,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006294643] [2025-03-03 20:59:47,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:47,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:47,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:59:47,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:59:47,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:47,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 20:59:47,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:47,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006294643] [2025-03-03 20:59:47,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006294643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:59:47,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655322065] [2025-03-03 20:59:47,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:47,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:59:47,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:59:47,452 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-03 20:59:47,454 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-03 20:59:47,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:59:47,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:59:47,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:47,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:47,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:59:47,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:59:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 20:59:47,672 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:59:47,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655322065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:47,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:59:47,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:59:47,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773895611] [2025-03-03 20:59:47,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:47,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:59:47,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:47,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:59:47,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:59:47,698 INFO L87 Difference]: Start difference. First operand has 125 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 89 states have internal predecessors, (127), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 20:59:47,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:47,740 INFO L93 Difference]: Finished difference Result 244 states and 419 transitions. [2025-03-03 20:59:47,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:59:47,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 218 [2025-03-03 20:59:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:47,751 INFO L225 Difference]: With dead ends: 244 [2025-03-03 20:59:47,753 INFO L226 Difference]: Without dead ends: 122 [2025-03-03 20:59:47,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 219 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-03 20:59:47,759 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:47,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:59:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-03 20:59:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-03 20:59:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 20:59:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 190 transitions. [2025-03-03 20:59:47,802 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 190 transitions. Word has length 218 [2025-03-03 20:59:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:47,802 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 190 transitions. [2025-03-03 20:59:47,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 20:59:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 190 transitions. [2025-03-03 20:59:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:59:47,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:47,805 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:59:47,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:59:48,006 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-03 20:59:48,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:48,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:48,007 INFO L85 PathProgramCache]: Analyzing trace with hash 407622372, now seen corresponding path program 1 times [2025-03-03 20:59:48,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:48,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741229348] [2025-03-03 20:59:48,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:48,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:59:48,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:59:48,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:48,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:48,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:59:48,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:48,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741229348] [2025-03-03 20:59:48,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741229348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:48,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:48,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:59:48,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184069450] [2025-03-03 20:59:48,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:48,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:59:48,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:48,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:59:48,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:59:48,742 INFO L87 Difference]: Start difference. First operand 122 states and 190 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:49,020 INFO L93 Difference]: Finished difference Result 361 states and 565 transitions. [2025-03-03 20:59:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:59:49,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 20:59:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:49,025 INFO L225 Difference]: With dead ends: 361 [2025-03-03 20:59:49,026 INFO L226 Difference]: Without dead ends: 242 [2025-03-03 20:59:49,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:59:49,029 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 128 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:49,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 517 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:59:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-03 20:59:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 183. [2025-03-03 20:59:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 112 states have internal predecessors, (148), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 20:59:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 284 transitions. [2025-03-03 20:59:49,077 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 284 transitions. Word has length 218 [2025-03-03 20:59:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:49,077 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 284 transitions. [2025-03-03 20:59:49,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:59:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 284 transitions. [2025-03-03 20:59:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:59:49,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:49,083 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:59:49,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:59:49,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:49,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1558153753, now seen corresponding path program 1 times [2025-03-03 20:59:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:49,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517713959] [2025-03-03 20:59:49,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:49,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:59:49,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:59:49,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:49,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:59:55,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517713959] [2025-03-03 20:59:55,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517713959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:55,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:55,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 20:59:55,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440596510] [2025-03-03 20:59:55,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:55,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 20:59:55,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:55,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 20:59:55,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-03 20:59:55,977 INFO L87 Difference]: Start difference. First operand 183 states and 284 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-03 20:59:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:59,736 INFO L93 Difference]: Finished difference Result 635 states and 960 transitions. [2025-03-03 20:59:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 20:59:59,736 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 219 [2025-03-03 20:59:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:59,740 INFO L225 Difference]: With dead ends: 635 [2025-03-03 20:59:59,740 INFO L226 Difference]: Without dead ends: 516 [2025-03-03 20:59:59,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 20:59:59,744 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 981 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 2403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:59,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1585 Invalid, 2403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 20:59:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-03 20:59:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 369. [2025-03-03 20:59:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 258 states have (on average 1.3604651162790697) internal successors, (351), 259 states have internal predecessors, (351), 102 states have call successors, (102), 8 states have call predecessors, (102), 8 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 20:59:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 555 transitions. [2025-03-03 20:59:59,796 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 555 transitions. Word has length 219 [2025-03-03 20:59:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:59,796 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 555 transitions. [2025-03-03 20:59:59,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-03 20:59:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 555 transitions. [2025-03-03 20:59:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:59:59,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:59,801 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:59:59,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:59:59,801 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:59,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:59,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1687236472, now seen corresponding path program 1 times [2025-03-03 20:59:59,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:59,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419195154] [2025-03-03 20:59:59,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:59,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:59,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:59:59,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:59:59,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:59,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:00:08,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:00:08,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419195154] [2025-03-03 21:00:08,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419195154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:08,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:00:08,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:00:08,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317501387] [2025-03-03 21:00:08,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:08,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:00:08,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:00:08,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:00:08,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:00:08,843 INFO L87 Difference]: Start difference. First operand 369 states and 555 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:00:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:10,683 INFO L93 Difference]: Finished difference Result 978 states and 1442 transitions. [2025-03-03 21:00:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 21:00:10,684 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 21:00:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:10,688 INFO L225 Difference]: With dead ends: 978 [2025-03-03 21:00:10,688 INFO L226 Difference]: Without dead ends: 859 [2025-03-03 21:00:10,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:00:10,690 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 950 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:10,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 935 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 21:00:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-03-03 21:00:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 422. [2025-03-03 21:00:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 311 states have (on average 1.392282958199357) internal successors, (433), 311 states have internal predecessors, (433), 102 states have call successors, (102), 8 states have call predecessors, (102), 8 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 21:00:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 637 transitions. [2025-03-03 21:00:10,729 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 637 transitions. Word has length 219 [2025-03-03 21:00:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:10,730 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 637 transitions. [2025-03-03 21:00:10,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:00:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 637 transitions. [2025-03-03 21:00:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 21:00:10,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:10,733 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:00:10,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:00:10,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:10,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1149329528, now seen corresponding path program 1 times [2025-03-03 21:00:10,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:00:10,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808921579] [2025-03-03 21:00:10,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:10,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:00:10,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 21:00:10,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 21:00:10,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:10,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:00:16,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:00:16,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808921579] [2025-03-03 21:00:16,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808921579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:16,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:00:16,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 21:00:16,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356200053] [2025-03-03 21:00:16,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:16,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 21:00:16,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:00:16,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 21:00:16,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-03 21:00:16,346 INFO L87 Difference]: Start difference. First operand 422 states and 637 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-03 21:00:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:20,021 INFO L93 Difference]: Finished difference Result 889 states and 1329 transitions. [2025-03-03 21:00:20,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 21:00:20,021 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 219 [2025-03-03 21:00:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:20,025 INFO L225 Difference]: With dead ends: 889 [2025-03-03 21:00:20,025 INFO L226 Difference]: Without dead ends: 561 [2025-03-03 21:00:20,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 21:00:20,027 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1045 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:20,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1329 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 21:00:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-03 21:00:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 427. [2025-03-03 21:00:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 316 states have (on average 1.389240506329114) internal successors, (439), 316 states have internal predecessors, (439), 102 states have call successors, (102), 8 states have call predecessors, (102), 8 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 21:00:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 643 transitions. [2025-03-03 21:00:20,055 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 643 transitions. Word has length 219 [2025-03-03 21:00:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:20,055 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 643 transitions. [2025-03-03 21:00:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-03 21:00:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 643 transitions. [2025-03-03 21:00:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 21:00:20,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:20,057 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:00:20,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:00:20,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:20,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:20,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1278412247, now seen corresponding path program 1 times [2025-03-03 21:00:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:00:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554648538] [2025-03-03 21:00:20,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:00:20,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 21:00:20,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 21:00:20,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:20,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:00:24,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:00:24,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554648538] [2025-03-03 21:00:24,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554648538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:24,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:00:24,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:00:24,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185296746] [2025-03-03 21:00:24,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:24,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:00:24,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:00:24,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:00:24,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:00:24,395 INFO L87 Difference]: Start difference. First operand 427 states and 643 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:00:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:27,583 INFO L93 Difference]: Finished difference Result 1200 states and 1783 transitions. [2025-03-03 21:00:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 21:00:27,583 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 21:00:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:27,589 INFO L225 Difference]: With dead ends: 1200 [2025-03-03 21:00:27,589 INFO L226 Difference]: Without dead ends: 1045 [2025-03-03 21:00:27,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 21:00:27,591 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 1380 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:27,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1452 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 21:00:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-03-03 21:00:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 479. [2025-03-03 21:00:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 368 states have (on average 1.4157608695652173) internal successors, (521), 368 states have internal predecessors, (521), 102 states have call successors, (102), 8 states have call predecessors, (102), 8 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 21:00:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 725 transitions. [2025-03-03 21:00:27,621 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 725 transitions. Word has length 219 [2025-03-03 21:00:27,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:27,622 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 725 transitions. [2025-03-03 21:00:27,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:00:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 725 transitions. [2025-03-03 21:00:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 21:00:27,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:27,625 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:00:27,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:00:27,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:27,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash -45497351, now seen corresponding path program 1 times [2025-03-03 21:00:27,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:00:27,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513450502] [2025-03-03 21:00:27,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:27,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:00:27,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 21:00:27,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 21:00:27,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:27,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:00:30,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:00:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513450502] [2025-03-03 21:00:30,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513450502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:30,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:00:30,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 21:00:30,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131706967] [2025-03-03 21:00:30,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:30,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:00:30,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:00:30,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:00:30,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:00:30,748 INFO L87 Difference]: Start difference. First operand 479 states and 725 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:00:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:32,726 INFO L93 Difference]: Finished difference Result 1106 states and 1649 transitions. [2025-03-03 21:00:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 21:00:32,727 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 21:00:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:32,731 INFO L225 Difference]: With dead ends: 1106 [2025-03-03 21:00:32,731 INFO L226 Difference]: Without dead ends: 939 [2025-03-03 21:00:32,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2025-03-03 21:00:32,732 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1179 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:32,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 1242 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 21:00:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-03 21:00:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 539. [2025-03-03 21:00:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 426 states have (on average 1.4413145539906103) internal successors, (614), 426 states have internal predecessors, (614), 102 states have call successors, (102), 10 states have call predecessors, (102), 10 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 21:00:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 818 transitions. [2025-03-03 21:00:32,757 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 818 transitions. Word has length 219 [2025-03-03 21:00:32,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:32,758 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 818 transitions. [2025-03-03 21:00:32,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:00:32,758 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 818 transitions. [2025-03-03 21:00:32,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 21:00:32,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:32,759 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:00:32,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:00:32,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:32,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:32,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1795298137, now seen corresponding path program 1 times [2025-03-03 21:00:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:00:32,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289120958] [2025-03-03 21:00:32,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:32,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:00:32,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 21:00:32,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 21:00:32,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:32,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:00:39,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:00:39,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289120958] [2025-03-03 21:00:39,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289120958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:39,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:00:39,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 21:00:39,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314326752] [2025-03-03 21:00:39,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:39,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 21:00:39,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:00:39,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 21:00:39,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:00:39,289 INFO L87 Difference]: Start difference. First operand 539 states and 818 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 21:00:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:42,702 INFO L93 Difference]: Finished difference Result 1205 states and 1810 transitions. [2025-03-03 21:00:42,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 21:00:42,703 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 219 [2025-03-03 21:00:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:42,706 INFO L225 Difference]: With dead ends: 1205 [2025-03-03 21:00:42,706 INFO L226 Difference]: Without dead ends: 803 [2025-03-03 21:00:42,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2025-03-03 21:00:42,709 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 881 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:42,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1293 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 21:00:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-03 21:00:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 558. [2025-03-03 21:00:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 443 states have (on average 1.435665914221219) internal successors, (636), 443 states have internal predecessors, (636), 102 states have call successors, (102), 12 states have call predecessors, (102), 12 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 21:00:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 840 transitions. [2025-03-03 21:00:42,733 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 840 transitions. Word has length 219 [2025-03-03 21:00:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:42,734 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 840 transitions. [2025-03-03 21:00:42,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 21:00:42,734 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 840 transitions. [2025-03-03 21:00:42,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 21:00:42,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:42,736 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:00:42,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:00:42,737 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:42,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:42,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2016124294, now seen corresponding path program 1 times [2025-03-03 21:00:42,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:00:42,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026916421] [2025-03-03 21:00:42,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:42,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:00:42,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 21:00:42,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 21:00:42,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:42,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:00:43,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:00:43,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026916421] [2025-03-03 21:00:43,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026916421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:43,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:00:43,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:00:43,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935894239] [2025-03-03 21:00:43,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:43,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:00:43,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:00:43,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:00:43,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:00:43,938 INFO L87 Difference]: Start difference. First operand 558 states and 840 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:00:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:44,569 INFO L93 Difference]: Finished difference Result 1144 states and 1734 transitions. [2025-03-03 21:00:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:00:44,570 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 21:00:44,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:44,573 INFO L225 Difference]: With dead ends: 1144 [2025-03-03 21:00:44,573 INFO L226 Difference]: Without dead ends: 727 [2025-03-03 21:00:44,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:00:44,579 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 373 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:44,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1190 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:00:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-03 21:00:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 549. [2025-03-03 21:00:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 434 states have (on average 1.433179723502304) internal successors, (622), 434 states have internal predecessors, (622), 102 states have call successors, (102), 12 states have call predecessors, (102), 12 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 21:00:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 826 transitions. [2025-03-03 21:00:44,618 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 826 transitions. Word has length 219 [2025-03-03 21:00:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:44,618 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 826 transitions. [2025-03-03 21:00:44,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 21:00:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 826 transitions. [2025-03-03 21:00:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 21:00:44,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:44,620 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:00:44,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:00:44,621 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:44,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:44,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1492049062, now seen corresponding path program 1 times [2025-03-03 21:00:44,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:00:44,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820655136] [2025-03-03 21:00:44,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:00:44,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 21:00:44,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 21:00:44,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:44,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 21:01:08,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:01:08,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820655136] [2025-03-03 21:01:08,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820655136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:01:08,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:01:08,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 21:01:08,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992059556] [2025-03-03 21:01:08,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:01:08,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 21:01:08,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:01:08,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 21:01:08,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2025-03-03 21:01:08,644 INFO L87 Difference]: Start difference. First operand 549 states and 826 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34)