./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-10.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 710670ca346a21719bd0508939f664ba04d58832b1c8a269a31e5aa376b94261 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:31:37,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:31:37,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:31:37,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:31:37,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:31:37,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:31:37,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:31:37,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:31:37,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:31:37,105 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:31:37,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:31:37,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:31:37,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:31:37,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:31:37,106 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:31:37,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:31:37,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:31:37,106 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:31:37,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:31:37,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:31:37,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:31:37,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:31:37,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:31:37,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:31:37,107 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:31:37,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:31:37,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:31:37,107 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:31:37,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:31:37,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:31:37,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:31:37,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:31:37,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:31:37,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:31:37,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:31:37,108 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:31:37,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:31:37,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:31:37,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:31:37,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:31:37,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:31:37,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:31:37,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:31:37,108 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-jdk21/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 -> 710670ca346a21719bd0508939f664ba04d58832b1c8a269a31e5aa376b94261 [2025-02-05 21:31:37,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:31:37,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:31:37,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:31:37,349 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:31:37,349 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:31:37,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-10.i [2025-02-05 21:31:38,534 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64f0bbe65/c4d6cdb438d042f9b6e70dadd1bc37c4/FLAGc6d134247 [2025-02-05 21:31:38,856 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:31:38,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-10.i [2025-02-05 21:31:38,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64f0bbe65/c4d6cdb438d042f9b6e70dadd1bc37c4/FLAGc6d134247 [2025-02-05 21:31:39,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64f0bbe65/c4d6cdb438d042f9b6e70dadd1bc37c4 [2025-02-05 21:31:39,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:31:39,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:31:39,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:31:39,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:31:39,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:31:39,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8d4cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39, skipping insertion in model container [2025-02-05 21:31:39,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:31:39,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-10.i[916,929] [2025-02-05 21:31:39,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:31:39,391 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:31:39,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-10.i[916,929] [2025-02-05 21:31:39,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:31:39,480 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:31:39,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39 WrapperNode [2025-02-05 21:31:39,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:31:39,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:31:39,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:31:39,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:31:39,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,551 INFO L138 Inliner]: procedures = 26, calls = 85, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 496 [2025-02-05 21:31:39,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:31:39,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:31:39,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:31:39,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:31:39,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,594 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:31:39,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:31:39,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:31:39,648 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:31:39,648 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:31:39,648 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (1/1) ... [2025-02-05 21:31:39,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:31:39,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:31:39,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:31:39,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:31:39,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:31:39,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:31:39,824 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:31:39,825 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:31:40,416 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L433: havoc property_#t~bitwise52#1;havoc property_#t~ite54#1;havoc property_#t~bitwise53#1;havoc property_#t~short55#1; [2025-02-05 21:31:40,495 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-05 21:31:40,495 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:31:40,522 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:31:40,523 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:31:40,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:31:40 BoogieIcfgContainer [2025-02-05 21:31:40,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:31:40,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:31:40,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:31:40,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:31:40,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:31:39" (1/3) ... [2025-02-05 21:31:40,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e23dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:31:40, skipping insertion in model container [2025-02-05 21:31:40,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:31:39" (2/3) ... [2025-02-05 21:31:40,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e23dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:31:40, skipping insertion in model container [2025-02-05 21:31:40,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:31:40" (3/3) ... [2025-02-05 21:31:40,537 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-10.i [2025-02-05 21:31:40,553 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:31:40,560 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-10.i that has 2 procedures, 219 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:31:40,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:31:40,622 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;@77c42fa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:31:40,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:31:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 219 states, 144 states have (on average 1.5138888888888888) internal successors, (218), 145 states have internal predecessors, (218), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-05 21:31:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-02-05 21:31:40,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:40,652 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:31:40,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:40,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:40,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1893316306, now seen corresponding path program 1 times [2025-02-05 21:31:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435441315] [2025-02-05 21:31:40,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:40,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 21:31:40,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 21:31:40,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:40,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-02-05 21:31:41,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:41,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435441315] [2025-02-05 21:31:41,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435441315] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:31:41,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195210117] [2025-02-05 21:31:41,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:41,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:31:41,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:31:41,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:31:41,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:31:41,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 21:31:41,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 21:31:41,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:41,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:41,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:31:41,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:31:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-02-05 21:31:41,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:31:41,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195210117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:41,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:31:41,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:31:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149704168] [2025-02-05 21:31:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:41,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:31:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:41,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:31:41,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:31:41,453 INFO L87 Difference]: Start difference. First operand has 219 states, 144 states have (on average 1.5138888888888888) internal successors, (218), 145 states have internal predecessors, (218), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-02-05 21:31:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:41,511 INFO L93 Difference]: Finished difference Result 431 states and 789 transitions. [2025-02-05 21:31:41,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:31:41,512 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) Word has length 454 [2025-02-05 21:31:41,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:41,519 INFO L225 Difference]: With dead ends: 431 [2025-02-05 21:31:41,519 INFO L226 Difference]: Without dead ends: 215 [2025-02-05 21:31:41,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 455 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-02-05 21:31:41,528 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:41,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:31:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-05 21:31:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-02-05 21:31:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 141 states have (on average 1.4893617021276595) internal successors, (210), 141 states have internal predecessors, (210), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-05 21:31:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 354 transitions. [2025-02-05 21:31:41,571 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 354 transitions. Word has length 454 [2025-02-05 21:31:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:41,571 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 354 transitions. [2025-02-05 21:31:41,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-02-05 21:31:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 354 transitions. [2025-02-05 21:31:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-02-05 21:31:41,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:41,577 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:31:41,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:31:41,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:31:41,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:41,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:41,778 INFO L85 PathProgramCache]: Analyzing trace with hash 675402732, now seen corresponding path program 1 times [2025-02-05 21:31:41,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:41,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056654152] [2025-02-05 21:31:41,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:41,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-05 21:31:41,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-05 21:31:41,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:41,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:31:42,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:42,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056654152] [2025-02-05 21:31:42,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056654152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:42,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:42,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:31:42,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927210867] [2025-02-05 21:31:42,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:42,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:31:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:42,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:31:42,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:31:42,191 INFO L87 Difference]: Start difference. First operand 215 states and 354 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:42,268 INFO L93 Difference]: Finished difference Result 552 states and 910 transitions. [2025-02-05 21:31:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:31:42,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 454 [2025-02-05 21:31:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:42,275 INFO L225 Difference]: With dead ends: 552 [2025-02-05 21:31:42,276 INFO L226 Difference]: Without dead ends: 340 [2025-02-05 21:31:42,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:31:42,278 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 199 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:42,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 679 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:31:42,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-02-05 21:31:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2025-02-05 21:31:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 232 states have (on average 1.5129310344827587) internal successors, (351), 233 states have internal predecessors, (351), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 21:31:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 555 transitions. [2025-02-05 21:31:42,331 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 555 transitions. Word has length 454 [2025-02-05 21:31:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:42,334 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 555 transitions. [2025-02-05 21:31:42,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 555 transitions. [2025-02-05 21:31:42,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-02-05 21:31:42,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:42,342 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:31:42,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:31:42,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:42,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash 241061363, now seen corresponding path program 1 times [2025-02-05 21:31:42,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:42,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553314785] [2025-02-05 21:31:42,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:42,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-02-05 21:31:42,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-02-05 21:31:42,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:42,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:31:42,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:42,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553314785] [2025-02-05 21:31:42,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553314785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:42,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:42,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:31:42,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96590279] [2025-02-05 21:31:42,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:42,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:31:42,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:42,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:31:42,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:31:42,698 INFO L87 Difference]: Start difference. First operand 337 states and 555 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:42,790 INFO L93 Difference]: Finished difference Result 914 states and 1504 transitions. [2025-02-05 21:31:42,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:31:42,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 455 [2025-02-05 21:31:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:42,799 INFO L225 Difference]: With dead ends: 914 [2025-02-05 21:31:42,800 INFO L226 Difference]: Without dead ends: 580 [2025-02-05 21:31:42,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:31:42,802 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 211 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:42,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 781 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:31:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-05 21:31:42,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 577. [2025-02-05 21:31:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 402 states have (on average 1.5049751243781095) internal successors, (605), 405 states have internal predecessors, (605), 170 states have call successors, (170), 4 states have call predecessors, (170), 4 states have return successors, (170), 167 states have call predecessors, (170), 170 states have call successors, (170) [2025-02-05 21:31:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 945 transitions. [2025-02-05 21:31:42,875 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 945 transitions. Word has length 455 [2025-02-05 21:31:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:42,876 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 945 transitions. [2025-02-05 21:31:42,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 945 transitions. [2025-02-05 21:31:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-02-05 21:31:42,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:42,882 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:31:42,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:31:42,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:42,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:42,883 INFO L85 PathProgramCache]: Analyzing trace with hash 252377490, now seen corresponding path program 1 times [2025-02-05 21:31:42,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:42,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082184099] [2025-02-05 21:31:42,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:42,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:42,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-02-05 21:31:42,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-02-05 21:31:42,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:42,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:31:43,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:43,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082184099] [2025-02-05 21:31:43,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082184099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:43,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:43,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:31:43,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209379564] [2025-02-05 21:31:43,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:43,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:31:43,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:43,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:31:43,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:31:43,534 INFO L87 Difference]: Start difference. First operand 577 states and 945 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:43,630 INFO L93 Difference]: Finished difference Result 1725 states and 2829 transitions. [2025-02-05 21:31:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:31:43,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 455 [2025-02-05 21:31:43,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:43,643 INFO L225 Difference]: With dead ends: 1725 [2025-02-05 21:31:43,643 INFO L226 Difference]: Without dead ends: 1151 [2025-02-05 21:31:43,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:31:43,648 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 204 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:43,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 688 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:31:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2025-02-05 21:31:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1145. [2025-02-05 21:31:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 796 states have (on average 1.5) internal successors, (1194), 802 states have internal predecessors, (1194), 340 states have call successors, (340), 8 states have call predecessors, (340), 8 states have return successors, (340), 334 states have call predecessors, (340), 340 states have call successors, (340) [2025-02-05 21:31:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1874 transitions. [2025-02-05 21:31:43,778 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1874 transitions. Word has length 455 [2025-02-05 21:31:43,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:43,778 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1874 transitions. [2025-02-05 21:31:43,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1874 transitions. [2025-02-05 21:31:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-02-05 21:31:43,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:43,786 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:31:43,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:31:43,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:43,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:43,788 INFO L85 PathProgramCache]: Analyzing trace with hash -156446735, now seen corresponding path program 1 times [2025-02-05 21:31:43,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:43,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161244358] [2025-02-05 21:31:43,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:43,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-02-05 21:31:43,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-02-05 21:31:43,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:43,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:31:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161244358] [2025-02-05 21:31:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161244358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:44,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:44,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:31:44,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798461799] [2025-02-05 21:31:44,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:44,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:31:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:44,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:31:44,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:31:44,467 INFO L87 Difference]: Start difference. First operand 1145 states and 1874 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:44,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:44,806 INFO L93 Difference]: Finished difference Result 2920 states and 4792 transitions. [2025-02-05 21:31:44,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:31:44,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 455 [2025-02-05 21:31:44,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:44,819 INFO L225 Difference]: With dead ends: 2920 [2025-02-05 21:31:44,819 INFO L226 Difference]: Without dead ends: 1778 [2025-02-05 21:31:44,823 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-02-05 21:31:44,824 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 294 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:44,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1021 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:31:44,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2025-02-05 21:31:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1520. [2025-02-05 21:31:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1097 states have (on average 1.553327256153145) internal successors, (1704), 1103 states have internal predecessors, (1704), 412 states have call successors, (412), 10 states have call predecessors, (412), 10 states have return successors, (412), 406 states have call predecessors, (412), 412 states have call successors, (412) [2025-02-05 21:31:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2528 transitions. [2025-02-05 21:31:44,975 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2528 transitions. Word has length 455 [2025-02-05 21:31:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:44,976 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 2528 transitions. [2025-02-05 21:31:44,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:31:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2528 transitions. [2025-02-05 21:31:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-05 21:31:44,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:44,983 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:31:44,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:31:44,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:44,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash 879024614, now seen corresponding path program 1 times [2025-02-05 21:31:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:44,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585779635] [2025-02-05 21:31:44,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:44,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:45,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-05 21:31:45,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-05 21:31:45,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:45,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:32:02,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:02,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585779635] [2025-02-05 21:32:02,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585779635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:02,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:02,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 21:32:02,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855332581] [2025-02-05 21:32:02,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:02,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:32:02,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:02,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:32:02,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:32:02,368 INFO L87 Difference]: Start difference. First operand 1520 states and 2528 transitions. Second operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 3 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2025-02-05 21:32:05,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:05,766 INFO L93 Difference]: Finished difference Result 4806 states and 7641 transitions. [2025-02-05 21:32:05,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 21:32:05,767 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 3 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) Word has length 456 [2025-02-05 21:32:05,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:05,790 INFO L225 Difference]: With dead ends: 4806 [2025-02-05 21:32:05,790 INFO L226 Difference]: Without dead ends: 3664 [2025-02-05 21:32:05,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2025-02-05 21:32:05,795 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 1214 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:05,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 2521 Invalid, 2097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 21:32:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2025-02-05 21:32:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 2681. [2025-02-05 21:32:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 1884 states have (on average 1.4479830148619957) internal successors, (2728), 1897 states have internal predecessors, (2728), 752 states have call successors, (752), 44 states have call predecessors, (752), 44 states have return successors, (752), 739 states have call predecessors, (752), 752 states have call successors, (752) [2025-02-05 21:32:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 4232 transitions. [2025-02-05 21:32:05,986 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 4232 transitions. Word has length 456 [2025-02-05 21:32:05,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:05,987 INFO L471 AbstractCegarLoop]: Abstraction has 2681 states and 4232 transitions. [2025-02-05 21:32:05,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 3 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2025-02-05 21:32:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 4232 transitions. [2025-02-05 21:32:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-05 21:32:05,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:05,990 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:32:05,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:32:05,991 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:05,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1008107333, now seen corresponding path program 1 times [2025-02-05 21:32:05,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:05,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516367404] [2025-02-05 21:32:05,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:05,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:06,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-05 21:32:06,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-05 21:32:06,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:06,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-05 21:32:53,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:53,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516367404] [2025-02-05 21:32:53,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516367404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:53,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:53,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 21:32:53,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098429482] [2025-02-05 21:32:53,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:53,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 21:32:53,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:53,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 21:32:53,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:32:53,480 INFO L87 Difference]: Start difference. First operand 2681 states and 4232 transitions. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:32:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:55,461 INFO L93 Difference]: Finished difference Result 4505 states and 7076 transitions. [2025-02-05 21:32:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:32:55,462 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 456 [2025-02-05 21:32:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:55,478 INFO L225 Difference]: With dead ends: 4505 [2025-02-05 21:32:55,478 INFO L226 Difference]: Without dead ends: 3363 [2025-02-05 21:32:55,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-02-05 21:32:55,484 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 538 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:55,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1848 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:32:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2025-02-05 21:32:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 2681. [2025-02-05 21:32:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 1884 states have (on average 1.4479830148619957) internal successors, (2728), 1897 states have internal predecessors, (2728), 752 states have call successors, (752), 44 states have call predecessors, (752), 44 states have return successors, (752), 739 states have call predecessors, (752), 752 states have call successors, (752) [2025-02-05 21:32:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 4232 transitions. [2025-02-05 21:32:55,643 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 4232 transitions. Word has length 456 [2025-02-05 21:32:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:55,644 INFO L471 AbstractCegarLoop]: Abstraction has 2681 states and 4232 transitions. [2025-02-05 21:32:55,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-05 21:32:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 4232 transitions. [2025-02-05 21:32:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-05 21:32:55,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:55,648 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:32:55,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:32:55,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:55,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1438964026, now seen corresponding path program 1 times [2025-02-05 21:32:55,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:55,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806804727] [2025-02-05 21:32:55,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:55,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:55,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-05 21:32:55,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-05 21:32:55,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:55,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat