./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/eca-rers2012/Problem12_label59.c -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 51dcd89c10622c543bf9ef783ec22401c3170140113dd2b2907b165950bd75af --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:49:49,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:49:49,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:49:49,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:49:49,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:49:49,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:49:49,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:49:49,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:49:49,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:49:49,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:49:49,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:49:49,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:49:49,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:49:49,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:49:49,126 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:49:49,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:49:49,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:49:49,127 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:49:49,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:49:49,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:49:49,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:49:49,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:49:49,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:49:49,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:49:49,127 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:49:49,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:49:49,127 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:49:49,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:49:49,128 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:49:49,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:49:49,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:49:49,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:49:49,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:49:49,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:49:49,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:49:49,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:49:49,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:49:49,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:49:49,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:49:49,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:49:49,129 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:49:49,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:49:49,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:49:49,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:49:49,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:49:49,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:49:49,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:49:49,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:49:49,130 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 -> 51dcd89c10622c543bf9ef783ec22401c3170140113dd2b2907b165950bd75af [2025-01-08 23:49:49,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:49:49,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:49:49,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:49:49,390 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:49:49,390 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:49:49,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label59.c [2025-01-08 23:49:50,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40e40d048/619656775d154bfab6357b339f9e9d6b/FLAG3da3731a2 [2025-01-08 23:49:50,999 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:49:50,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label59.c [2025-01-08 23:49:51,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40e40d048/619656775d154bfab6357b339f9e9d6b/FLAG3da3731a2 [2025-01-08 23:49:51,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40e40d048/619656775d154bfab6357b339f9e9d6b [2025-01-08 23:49:51,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:49:51,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:49:51,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:49:51,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:49:51,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:49:51,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:49:51" (1/1) ... [2025-01-08 23:49:51,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:51, skipping insertion in model container [2025-01-08 23:49:51,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:49:51" (1/1) ... [2025-01-08 23:49:51,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:49:51,336 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/eca-rers2012/Problem12_label59.c[5577,5590] [2025-01-08 23:49:51,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:49:51,780 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:49:51,793 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/eca-rers2012/Problem12_label59.c[5577,5590] [2025-01-08 23:49:52,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:49:52,051 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:49:52,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52 WrapperNode [2025-01-08 23:49:52,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:49:52,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:49:52,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:49:52,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:49:52,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,342 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-01-08 23:49:52,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:49:52,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:49:52,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:49:52,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:49:52,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,548 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-01-08 23:49:52,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,664 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:49:52,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:49:52,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:49:52,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:49:52,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (1/1) ... [2025-01-08 23:49:52,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:49:52,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:49:52,841 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-01-08 23:49:52,845 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-01-08 23:49:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:49:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:49:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:49:52,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:49:52,915 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:49:52,916 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:49:56,277 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-01-08 23:49:56,278 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:49:56,305 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:49:56,310 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:49:56,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:49:56 BoogieIcfgContainer [2025-01-08 23:49:56,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:49:56,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:49:56,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:49:56,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:49:56,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:49:51" (1/3) ... [2025-01-08 23:49:56,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49abe7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:49:56, skipping insertion in model container [2025-01-08 23:49:56,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:52" (2/3) ... [2025-01-08 23:49:56,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49abe7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:49:56, skipping insertion in model container [2025-01-08 23:49:56,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:49:56" (3/3) ... [2025-01-08 23:49:56,319 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label59.c [2025-01-08 23:49:56,329 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:49:56,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label59.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:49:56,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:49:56,410 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;@2f04d588, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:49:56,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:49:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-08 23:49:56,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:56,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:49:56,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:56,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:56,425 INFO L85 PathProgramCache]: Analyzing trace with hash -730872606, now seen corresponding path program 1 times [2025-01-08 23:49:56,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283449784] [2025-01-08 23:49:56,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:56,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:56,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-08 23:49:56,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-08 23:49:56,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:56,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:49:56,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:56,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283449784] [2025-01-08 23:49:56,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283449784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:56,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:56,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:49:56,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339998952] [2025-01-08 23:49:56,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:56,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:56,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:56,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:56,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:56,751 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:59,599 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-01-08 23:49:59,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:59,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-08 23:49:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:59,614 INFO L225 Difference]: With dead ends: 2388 [2025-01-08 23:49:59,614 INFO L226 Difference]: Without dead ends: 1506 [2025-01-08 23:49:59,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:49:59,620 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 792 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:59,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 112 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:49:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-08 23:49:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-01-08 23:49:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.86578073089701) internal successors, (2808), 1505 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2808 transitions. [2025-01-08 23:49:59,706 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2808 transitions. Word has length 44 [2025-01-08 23:49:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:59,707 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2808 transitions. [2025-01-08 23:49:59,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2808 transitions. [2025-01-08 23:49:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-08 23:49:59,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:59,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:49:59,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:49:59,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:59,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash -660363589, now seen corresponding path program 1 times [2025-01-08 23:49:59,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:59,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430670401] [2025-01-08 23:49:59,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:59,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:59,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-08 23:49:59,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-08 23:49:59,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:59,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:49:59,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:59,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430670401] [2025-01-08 23:49:59,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430670401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:59,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:59,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:49:59,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057376035] [2025-01-08 23:49:59,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:59,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:49:59,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:59,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:49:59,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:49:59,989 INFO L87 Difference]: Start difference. First operand 1506 states and 2808 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:03,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:03,761 INFO L93 Difference]: Finished difference Result 5271 states and 9796 transitions. [2025-01-08 23:50:03,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:50:03,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-01-08 23:50:03,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:03,773 INFO L225 Difference]: With dead ends: 5271 [2025-01-08 23:50:03,773 INFO L226 Difference]: Without dead ends: 3767 [2025-01-08 23:50:03,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01-08 23:50:03,776 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 2312 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 5141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1529 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:03,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2312 Valid, 197 Invalid, 5141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1529 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-08 23:50:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2025-01-08 23:50:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3759. [2025-01-08 23:50:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.6056412985630655) internal successors, (6034), 3758 states have internal predecessors, (6034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 6034 transitions. [2025-01-08 23:50:03,839 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 6034 transitions. Word has length 109 [2025-01-08 23:50:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:03,840 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 6034 transitions. [2025-01-08 23:50:03,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 6034 transitions. [2025-01-08 23:50:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-08 23:50:03,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:03,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:50:03,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:50:03,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:03,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1657854324, now seen corresponding path program 1 times [2025-01-08 23:50:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:03,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000694869] [2025-01-08 23:50:03,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:03,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:03,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-08 23:50:03,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-08 23:50:03,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:03,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:50:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:04,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000694869] [2025-01-08 23:50:04,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000694869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:04,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:04,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:04,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556114595] [2025-01-08 23:50:04,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:04,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:50:04,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:04,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:50:04,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:50:04,221 INFO L87 Difference]: Start difference. First operand 3759 states and 6034 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:06,896 INFO L93 Difference]: Finished difference Result 10559 states and 17378 transitions. [2025-01-08 23:50:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:50:06,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-01-08 23:50:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:06,917 INFO L225 Difference]: With dead ends: 10559 [2025-01-08 23:50:06,917 INFO L226 Difference]: Without dead ends: 6765 [2025-01-08 23:50:06,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:50:06,922 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 704 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:06,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 710 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 3109 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:50:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6765 states. [2025-01-08 23:50:07,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6765 to 6763. [2025-01-08 23:50:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.357438627624963) internal successors, (9179), 6762 states have internal predecessors, (9179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 9179 transitions. [2025-01-08 23:50:07,018 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 9179 transitions. Word has length 115 [2025-01-08 23:50:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:07,018 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 9179 transitions. [2025-01-08 23:50:07,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 9179 transitions. [2025-01-08 23:50:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-08 23:50:07,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:07,020 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:50:07,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:50:07,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:07,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:07,021 INFO L85 PathProgramCache]: Analyzing trace with hash -681525517, now seen corresponding path program 1 times [2025-01-08 23:50:07,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:07,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663912029] [2025-01-08 23:50:07,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:07,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:07,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-08 23:50:07,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-08 23:50:07,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:07,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:50:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:07,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663912029] [2025-01-08 23:50:07,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663912029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:07,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:07,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223194236] [2025-01-08 23:50:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:07,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:07,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:07,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:07,374 INFO L87 Difference]: Start difference. First operand 6763 states and 9179 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:09,646 INFO L93 Difference]: Finished difference Result 16528 states and 23482 transitions. [2025-01-08 23:50:09,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:09,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2025-01-08 23:50:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:09,671 INFO L225 Difference]: With dead ends: 16528 [2025-01-08 23:50:09,672 INFO L226 Difference]: Without dead ends: 9767 [2025-01-08 23:50:09,680 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-01-08 23:50:09,683 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 734 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2435 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 2435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:09,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1358 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 2435 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:50:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-01-08 23:50:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-01-08 23:50:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.3271554372312102) internal successors, (12961), 9766 states have internal predecessors, (12961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12961 transitions. [2025-01-08 23:50:09,873 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12961 transitions. Word has length 189 [2025-01-08 23:50:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:09,875 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12961 transitions. [2025-01-08 23:50:09,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12961 transitions. [2025-01-08 23:50:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-08 23:50:09,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:09,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:50:09,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:50:09,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:09,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1901510188, now seen corresponding path program 1 times [2025-01-08 23:50:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:09,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432415307] [2025-01-08 23:50:09,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:09,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-08 23:50:09,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-08 23:50:09,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:09,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-01-08 23:50:10,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:10,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432415307] [2025-01-08 23:50:10,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432415307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:10,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:10,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:50:10,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743635477] [2025-01-08 23:50:10,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:10,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:10,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:10,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:10,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:10,061 INFO L87 Difference]: Start difference. First operand 9767 states and 12961 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:12,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:12,403 INFO L93 Difference]: Finished difference Result 25542 states and 34829 transitions. [2025-01-08 23:50:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:12,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2025-01-08 23:50:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:12,438 INFO L225 Difference]: With dead ends: 25542 [2025-01-08 23:50:12,438 INFO L226 Difference]: Without dead ends: 15777 [2025-01-08 23:50:12,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:50:12,453 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:12,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 388 Invalid, 2809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:50:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15777 states. [2025-01-08 23:50:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15777 to 15775. [2025-01-08 23:50:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.301572207429948) internal successors, (20531), 15774 states have internal predecessors, (20531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 20531 transitions. [2025-01-08 23:50:12,645 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 20531 transitions. Word has length 251 [2025-01-08 23:50:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:12,645 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 20531 transitions. [2025-01-08 23:50:12,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 20531 transitions. [2025-01-08 23:50:12,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-01-08 23:50:12,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:12,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:50:12,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:50:12,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:12,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:12,649 INFO L85 PathProgramCache]: Analyzing trace with hash -440954543, now seen corresponding path program 1 times [2025-01-08 23:50:12,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:12,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392521092] [2025-01-08 23:50:12,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:12,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:12,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-08 23:50:12,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-08 23:50:12,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:12,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 23:50:13,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:13,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392521092] [2025-01-08 23:50:13,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392521092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:13,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:13,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544083142] [2025-01-08 23:50:13,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:13,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:50:13,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:13,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:50:13,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:50:13,094 INFO L87 Difference]: Start difference. First operand 15775 states and 20531 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:15,359 INFO L93 Difference]: Finished difference Result 31587 states and 41098 transitions. [2025-01-08 23:50:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:50:15,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2025-01-08 23:50:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:15,384 INFO L225 Difference]: With dead ends: 31587 [2025-01-08 23:50:15,384 INFO L226 Difference]: Without dead ends: 15777 [2025-01-08 23:50:15,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:50:15,396 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 850 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:15,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 402 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:50:15,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15777 states. [2025-01-08 23:50:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15777 to 15775. [2025-01-08 23:50:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2801445416508177) internal successors, (20193), 15774 states have internal predecessors, (20193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 20193 transitions. [2025-01-08 23:50:15,538 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 20193 transitions. Word has length 256 [2025-01-08 23:50:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:15,539 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 20193 transitions. [2025-01-08 23:50:15,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 20193 transitions. [2025-01-08 23:50:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-08 23:50:15,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:15,545 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:50:15,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:50:15,545 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:15,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash -782296079, now seen corresponding path program 1 times [2025-01-08 23:50:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:15,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42909673] [2025-01-08 23:50:15,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:15,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:15,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-08 23:50:15,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-08 23:50:15,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:15,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-08 23:50:15,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42909673] [2025-01-08 23:50:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42909673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:15,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:15,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:50:15,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486506060] [2025-01-08 23:50:15,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:15,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:15,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:15,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:15,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:15,728 INFO L87 Difference]: Start difference. First operand 15775 states and 20193 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:18,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:18,116 INFO L93 Difference]: Finished difference Result 44315 states and 57309 transitions. [2025-01-08 23:50:18,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:18,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-01-08 23:50:18,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:18,152 INFO L225 Difference]: With dead ends: 44315 [2025-01-08 23:50:18,152 INFO L226 Difference]: Without dead ends: 28542 [2025-01-08 23:50:18,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:50:18,163 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 652 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 815 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 815 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:18,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 524 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [815 Valid, 2001 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:50:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28542 states. [2025-01-08 23:50:18,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28542 to 23285. [2025-01-08 23:50:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.2308022676516062) internal successors, (28658), 23284 states have internal predecessors, (28658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 28658 transitions. [2025-01-08 23:50:18,367 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 28658 transitions. Word has length 265 [2025-01-08 23:50:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:18,368 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 28658 transitions. [2025-01-08 23:50:18,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 28658 transitions. [2025-01-08 23:50:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-08 23:50:18,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:18,372 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:50:18,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:50:18,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:18,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:18,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1988326641, now seen corresponding path program 1 times [2025-01-08 23:50:18,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:18,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065729867] [2025-01-08 23:50:18,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:18,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:18,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-08 23:50:18,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-08 23:50:18,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:18,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-08 23:50:18,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:18,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065729867] [2025-01-08 23:50:18,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065729867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:18,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:18,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:18,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551343879] [2025-01-08 23:50:18,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:18,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:18,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:18,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:18,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:18,687 INFO L87 Difference]: Start difference. First operand 23285 states and 28658 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:20,924 INFO L93 Difference]: Finished difference Result 58584 states and 71943 transitions. [2025-01-08 23:50:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:20,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2025-01-08 23:50:20,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:20,970 INFO L225 Difference]: With dead ends: 58584 [2025-01-08 23:50:20,970 INFO L226 Difference]: Without dead ends: 35301 [2025-01-08 23:50:20,988 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-01-08 23:50:20,989 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 696 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:20,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 272 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 2422 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-08 23:50:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35301 states. [2025-01-08 23:50:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35301 to 33799. [2025-01-08 23:50:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33799 states, 33798 states have (on average 1.2203384815669567) internal successors, (41245), 33798 states have internal predecessors, (41245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33799 states to 33799 states and 41245 transitions. [2025-01-08 23:50:21,302 INFO L78 Accepts]: Start accepts. Automaton has 33799 states and 41245 transitions. Word has length 344 [2025-01-08 23:50:21,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:21,302 INFO L471 AbstractCegarLoop]: Abstraction has 33799 states and 41245 transitions. [2025-01-08 23:50:21,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 33799 states and 41245 transitions. [2025-01-08 23:50:21,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-08 23:50:21,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:21,371 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:50:21,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:50:21,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:21,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1986094906, now seen corresponding path program 1 times [2025-01-08 23:50:21,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:21,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446459403] [2025-01-08 23:50:21,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:21,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:21,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-08 23:50:21,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-08 23:50:21,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:21,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-08 23:50:21,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:21,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446459403] [2025-01-08 23:50:21,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446459403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:21,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:21,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:21,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367536863] [2025-01-08 23:50:21,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:21,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:21,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:21,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:21,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:21,587 INFO L87 Difference]: Start difference. First operand 33799 states and 41245 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:23,822 INFO L93 Difference]: Finished difference Result 86371 states and 106828 transitions. [2025-01-08 23:50:23,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:23,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 357 [2025-01-08 23:50:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:23,881 INFO L225 Difference]: With dead ends: 86371 [2025-01-08 23:50:23,881 INFO L226 Difference]: Without dead ends: 52574 [2025-01-08 23:50:23,899 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-01-08 23:50:23,899 INFO L435 NwaCegarLoop]: 1217 mSDtfsCounter, 679 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2258 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 2258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:23,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1225 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 2258 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-08 23:50:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52574 states. [2025-01-08 23:50:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52574 to 51072. [2025-01-08 23:50:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51072 states, 51071 states have (on average 1.1774000900706858) internal successors, (60131), 51071 states have internal predecessors, (60131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51072 states to 51072 states and 60131 transitions. [2025-01-08 23:50:24,470 INFO L78 Accepts]: Start accepts. Automaton has 51072 states and 60131 transitions. Word has length 357 [2025-01-08 23:50:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:24,470 INFO L471 AbstractCegarLoop]: Abstraction has 51072 states and 60131 transitions. [2025-01-08 23:50:24,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 51072 states and 60131 transitions. [2025-01-08 23:50:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-01-08 23:50:24,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:24,475 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:50:24,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:50:24,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:24,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:24,477 INFO L85 PathProgramCache]: Analyzing trace with hash 977929515, now seen corresponding path program 1 times [2025-01-08 23:50:24,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:24,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242097187] [2025-01-08 23:50:24,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:24,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:24,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-08 23:50:24,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-08 23:50:24,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:24,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-08 23:50:24,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242097187] [2025-01-08 23:50:24,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242097187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:24,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:24,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:24,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698401569] [2025-01-08 23:50:24,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:24,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:24,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:24,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:24,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:24,676 INFO L87 Difference]: Start difference. First operand 51072 states and 60131 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:27,014 INFO L93 Difference]: Finished difference Result 125423 states and 147155 transitions. [2025-01-08 23:50:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:27,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 372 [2025-01-08 23:50:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:27,095 INFO L225 Difference]: With dead ends: 125423 [2025-01-08 23:50:27,095 INFO L226 Difference]: Without dead ends: 74353 [2025-01-08 23:50:27,125 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-01-08 23:50:27,125 INFO L435 NwaCegarLoop]: 1286 mSDtfsCounter, 761 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:27,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1294 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2154 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-08 23:50:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74353 states. [2025-01-08 23:50:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74353 to 71349. [2025-01-08 23:50:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71349 states, 71348 states have (on average 1.1491702640578572) internal successors, (81991), 71348 states have internal predecessors, (81991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71349 states to 71349 states and 81991 transitions. [2025-01-08 23:50:28,026 INFO L78 Accepts]: Start accepts. Automaton has 71349 states and 81991 transitions. Word has length 372 [2025-01-08 23:50:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:28,027 INFO L471 AbstractCegarLoop]: Abstraction has 71349 states and 81991 transitions. [2025-01-08 23:50:28,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 71349 states and 81991 transitions. [2025-01-08 23:50:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-08 23:50:28,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:28,030 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:28,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:50:28,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:28,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:28,031 INFO L85 PathProgramCache]: Analyzing trace with hash -383777614, now seen corresponding path program 1 times [2025-01-08 23:50:28,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:28,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994440398] [2025-01-08 23:50:28,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:28,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-08 23:50:28,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-08 23:50:28,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:28,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-08 23:50:28,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:28,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994440398] [2025-01-08 23:50:28,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994440398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:28,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:28,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:28,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529542212] [2025-01-08 23:50:28,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:28,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:28,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:28,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:28,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:28,245 INFO L87 Difference]: Start difference. First operand 71349 states and 81991 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:30,632 INFO L93 Difference]: Finished difference Result 150957 states and 172651 transitions. [2025-01-08 23:50:30,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:30,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 382 [2025-01-08 23:50:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:30,710 INFO L225 Difference]: With dead ends: 150957 [2025-01-08 23:50:30,710 INFO L226 Difference]: Without dead ends: 79610 [2025-01-08 23:50:30,750 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-01-08 23:50:30,750 INFO L435 NwaCegarLoop]: 1181 mSDtfsCounter, 647 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:30,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1189 Invalid, 2887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 2561 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-08 23:50:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79610 states. [2025-01-08 23:50:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79610 to 76606. [2025-01-08 23:50:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76606 states, 76605 states have (on average 1.132367338946544) internal successors, (86745), 76605 states have internal predecessors, (86745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76606 states to 76606 states and 86745 transitions. [2025-01-08 23:50:31,598 INFO L78 Accepts]: Start accepts. Automaton has 76606 states and 86745 transitions. Word has length 382 [2025-01-08 23:50:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:31,599 INFO L471 AbstractCegarLoop]: Abstraction has 76606 states and 86745 transitions. [2025-01-08 23:50:31,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 76606 states and 86745 transitions. [2025-01-08 23:50:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-01-08 23:50:31,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:31,602 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:50:31,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:50:31,602 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:31,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash -635388612, now seen corresponding path program 1 times [2025-01-08 23:50:31,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:31,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297280778] [2025-01-08 23:50:31,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:31,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:31,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-01-08 23:50:31,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-01-08 23:50:31,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:31,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-08 23:50:31,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:31,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297280778] [2025-01-08 23:50:31,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297280778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:31,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:31,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678582688] [2025-01-08 23:50:31,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:31,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:31,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:31,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:31,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:31,848 INFO L87 Difference]: Start difference. First operand 76606 states and 86745 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:34,318 INFO L93 Difference]: Finished difference Result 175740 states and 201721 transitions. [2025-01-08 23:50:34,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:34,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 386 [2025-01-08 23:50:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:34,444 INFO L225 Difference]: With dead ends: 175740 [2025-01-08 23:50:34,444 INFO L226 Difference]: Without dead ends: 99136 [2025-01-08 23:50:34,499 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-01-08 23:50:34,500 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 686 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:34,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1285 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-08 23:50:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99136 states. [2025-01-08 23:50:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99136 to 98385. [2025-01-08 23:50:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98385 states, 98384 states have (on average 1.1175902585786306) internal successors, (109953), 98384 states have internal predecessors, (109953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98385 states to 98385 states and 109953 transitions. [2025-01-08 23:50:35,548 INFO L78 Accepts]: Start accepts. Automaton has 98385 states and 109953 transitions. Word has length 386 [2025-01-08 23:50:35,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:35,548 INFO L471 AbstractCegarLoop]: Abstraction has 98385 states and 109953 transitions. [2025-01-08 23:50:35,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:35,548 INFO L276 IsEmpty]: Start isEmpty. Operand 98385 states and 109953 transitions. [2025-01-08 23:50:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-01-08 23:50:35,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:35,552 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:35,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:50:35,553 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:35,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash -25144661, now seen corresponding path program 1 times [2025-01-08 23:50:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:35,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534752998] [2025-01-08 23:50:35,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:35,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:35,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-01-08 23:50:35,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-01-08 23:50:35,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:35,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 125 proven. 108 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-08 23:50:36,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:36,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534752998] [2025-01-08 23:50:36,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534752998] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:50:36,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704783074] [2025-01-08 23:50:36,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:36,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:50:36,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:50:36,242 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-01-08 23:50:36,244 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-01-08 23:50:36,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-01-08 23:50:36,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-01-08 23:50:36,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:36,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:36,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:50:36,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:50:36,496 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-08 23:50:36,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:50:36,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704783074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:36,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:50:36,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:50:36,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084325842] [2025-01-08 23:50:36,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:36,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:36,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:36,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:36,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:50:36,497 INFO L87 Difference]: Start difference. First operand 98385 states and 109953 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:39,119 INFO L93 Difference]: Finished difference Result 193764 states and 216774 transitions. [2025-01-08 23:50:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:39,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 427 [2025-01-08 23:50:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:39,220 INFO L225 Difference]: With dead ends: 193764 [2025-01-08 23:50:39,220 INFO L226 Difference]: Without dead ends: 95381 [2025-01-08 23:50:39,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:50:39,278 INFO L435 NwaCegarLoop]: 1302 mSDtfsCounter, 747 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 631 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 631 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:39,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1310 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [631 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:50:39,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95381 states. [2025-01-08 23:50:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95381 to 92377. [2025-01-08 23:50:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92377 states, 92376 states have (on average 1.0681887070234692) internal successors, (98675), 92376 states have internal predecessors, (98675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92377 states to 92377 states and 98675 transitions. [2025-01-08 23:50:40,494 INFO L78 Accepts]: Start accepts. Automaton has 92377 states and 98675 transitions. Word has length 427 [2025-01-08 23:50:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:40,494 INFO L471 AbstractCegarLoop]: Abstraction has 92377 states and 98675 transitions. [2025-01-08 23:50:40,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 92377 states and 98675 transitions. [2025-01-08 23:50:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-01-08 23:50:40,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:40,498 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:50:40,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:50:40,699 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,SelfDestructingSolverStorable12 [2025-01-08 23:50:40,699 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:40,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:40,700 INFO L85 PathProgramCache]: Analyzing trace with hash 992768306, now seen corresponding path program 1 times [2025-01-08 23:50:40,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:40,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316085545] [2025-01-08 23:50:40,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:40,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:40,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-01-08 23:50:40,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-01-08 23:50:40,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:40,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:50:41,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:41,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316085545] [2025-01-08 23:50:41,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316085545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:41,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:41,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262596153] [2025-01-08 23:50:41,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:41,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:41,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:41,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:41,134 INFO L87 Difference]: Start difference. First operand 92377 states and 98675 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:43,333 INFO L93 Difference]: Finished difference Result 200523 states and 214643 transitions. [2025-01-08 23:50:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:43,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2025-01-08 23:50:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:43,461 INFO L225 Difference]: With dead ends: 200523 [2025-01-08 23:50:43,462 INFO L226 Difference]: Without dead ends: 108148 [2025-01-08 23:50:43,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:43,517 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 779 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:43,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 950 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-08 23:50:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108148 states. [2025-01-08 23:50:44,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108148 to 101389. [2025-01-08 23:50:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101389 states, 101388 states have (on average 1.0682822424744545) internal successors, (108311), 101388 states have internal predecessors, (108311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101389 states to 101389 states and 108311 transitions. [2025-01-08 23:50:44,587 INFO L78 Accepts]: Start accepts. Automaton has 101389 states and 108311 transitions. Word has length 440 [2025-01-08 23:50:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:44,587 INFO L471 AbstractCegarLoop]: Abstraction has 101389 states and 108311 transitions. [2025-01-08 23:50:44,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 101389 states and 108311 transitions. [2025-01-08 23:50:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-01-08 23:50:44,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:44,597 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:44,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:50:44,597 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:44,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:44,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1330123864, now seen corresponding path program 1 times [2025-01-08 23:50:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:44,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511738131] [2025-01-08 23:50:44,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:44,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-01-08 23:50:44,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-01-08 23:50:44,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:44,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-08 23:50:44,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511738131] [2025-01-08 23:50:44,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511738131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:44,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:44,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:44,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887408551] [2025-01-08 23:50:44,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:44,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:44,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:44,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:44,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:44,948 INFO L87 Difference]: Start difference. First operand 101389 states and 108311 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:47,268 INFO L93 Difference]: Finished difference Result 209535 states and 223527 transitions. [2025-01-08 23:50:47,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:47,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 497 [2025-01-08 23:50:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:47,384 INFO L225 Difference]: With dead ends: 209535 [2025-01-08 23:50:47,384 INFO L226 Difference]: Without dead ends: 107397 [2025-01-08 23:50:47,432 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-01-08 23:50:47,433 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 725 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 671 IncrementalHoareTripleChecker+Valid, 2091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:47,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1060 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [671 Valid, 2091 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-08 23:50:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107397 states. [2025-01-08 23:50:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107397 to 101389. [2025-01-08 23:50:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101389 states, 101388 states have (on average 1.0587446246104075) internal successors, (107344), 101388 states have internal predecessors, (107344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101389 states to 101389 states and 107344 transitions. [2025-01-08 23:50:48,549 INFO L78 Accepts]: Start accepts. Automaton has 101389 states and 107344 transitions. Word has length 497 [2025-01-08 23:50:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:48,549 INFO L471 AbstractCegarLoop]: Abstraction has 101389 states and 107344 transitions. [2025-01-08 23:50:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 101389 states and 107344 transitions. [2025-01-08 23:50:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-01-08 23:50:48,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:48,555 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:48,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:50:48,555 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:48,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:48,556 INFO L85 PathProgramCache]: Analyzing trace with hash 960449759, now seen corresponding path program 1 times [2025-01-08 23:50:48,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:48,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138143322] [2025-01-08 23:50:48,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:48,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:48,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-01-08 23:50:48,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-01-08 23:50:48,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:48,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 363 proven. 108 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-08 23:50:49,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:49,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138143322] [2025-01-08 23:50:49,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138143322] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:50:49,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668056409] [2025-01-08 23:50:49,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:49,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:50:49,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:50:49,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:50:49,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:50:49,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-01-08 23:50:49,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-01-08 23:50:49,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:49,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:49,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:50:49,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:50:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-08 23:50:49,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:50:49,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668056409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:49,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:50:49,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:50:49,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182924182] [2025-01-08 23:50:49,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:49,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:49,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:49,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:49,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:50:49,553 INFO L87 Difference]: Start difference. First operand 101389 states and 107344 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:51,755 INFO L93 Difference]: Finished difference Result 204278 states and 216192 transitions. [2025-01-08 23:50:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:51,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 507 [2025-01-08 23:50:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:51,866 INFO L225 Difference]: With dead ends: 204278 [2025-01-08 23:50:51,866 INFO L226 Difference]: Without dead ends: 103642 [2025-01-08 23:50:51,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:50:51,898 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 738 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:51,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 412 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-08 23:50:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103642 states. [2025-01-08 23:50:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103642 to 99136. [2025-01-08 23:50:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99136 states, 99135 states have (on average 1.0486609169314571) internal successors, (103959), 99135 states have internal predecessors, (103959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99136 states to 99136 states and 103959 transitions. [2025-01-08 23:50:52,995 INFO L78 Accepts]: Start accepts. Automaton has 99136 states and 103959 transitions. Word has length 507 [2025-01-08 23:50:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:52,995 INFO L471 AbstractCegarLoop]: Abstraction has 99136 states and 103959 transitions. [2025-01-08 23:50:52,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 99136 states and 103959 transitions. [2025-01-08 23:50:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-01-08 23:50:53,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:53,001 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:53,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:50:53,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-08 23:50:53,202 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:53,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:53,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1497841366, now seen corresponding path program 1 times [2025-01-08 23:50:53,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:53,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895610662] [2025-01-08 23:50:53,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:53,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:53,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-01-08 23:50:53,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-01-08 23:50:53,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:53,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-01-08 23:50:53,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:53,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895610662] [2025-01-08 23:50:53,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895610662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:53,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:53,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:53,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652860591] [2025-01-08 23:50:53,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:53,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:53,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:53,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:53,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:53,601 INFO L87 Difference]: Start difference. First operand 99136 states and 103959 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:56,247 INFO L93 Difference]: Finished difference Result 247836 states and 260736 transitions. [2025-01-08 23:50:56,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:56,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 528 [2025-01-08 23:50:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:56,404 INFO L225 Difference]: With dead ends: 247836 [2025-01-08 23:50:56,404 INFO L226 Difference]: Without dead ends: 149453 [2025-01-08 23:50:56,450 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-01-08 23:50:56,450 INFO L435 NwaCegarLoop]: 1204 mSDtfsCounter, 757 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:56,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1212 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:50:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149453 states. [2025-01-08 23:50:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149453 to 144947. [2025-01-08 23:50:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144947 states, 144946 states have (on average 1.0476867247112718) internal successors, (151858), 144946 states have internal predecessors, (151858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144947 states to 144947 states and 151858 transitions. [2025-01-08 23:50:57,874 INFO L78 Accepts]: Start accepts. Automaton has 144947 states and 151858 transitions. Word has length 528 [2025-01-08 23:50:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:57,875 INFO L471 AbstractCegarLoop]: Abstraction has 144947 states and 151858 transitions. [2025-01-08 23:50:57,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 144947 states and 151858 transitions. [2025-01-08 23:50:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-01-08 23:50:57,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:57,885 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:57,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:50:57,885 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:57,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:57,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1492814568, now seen corresponding path program 1 times [2025-01-08 23:50:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:57,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236138211] [2025-01-08 23:50:57,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:57,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:57,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-01-08 23:50:57,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-01-08 23:50:57,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:57,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-01-08 23:50:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236138211] [2025-01-08 23:50:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236138211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:58,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:58,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062677866] [2025-01-08 23:50:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:58,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:58,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:58,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:58,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:58,085 INFO L87 Difference]: Start difference. First operand 144947 states and 151858 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:00,971 INFO L93 Difference]: Finished difference Result 292145 states and 305974 transitions. [2025-01-08 23:51:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:00,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 597 [2025-01-08 23:51:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:01,150 INFO L225 Difference]: With dead ends: 292145 [2025-01-08 23:51:01,150 INFO L226 Difference]: Without dead ends: 144947 [2025-01-08 23:51:01,208 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-01-08 23:51:01,208 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 672 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:01,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1222 Invalid, 2475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-08 23:51:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144947 states. [2025-01-08 23:51:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144947 to 138188. [2025-01-08 23:51:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138188 states, 138187 states have (on average 1.0370440055866326) internal successors, (143306), 138187 states have internal predecessors, (143306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138188 states to 138188 states and 143306 transitions. [2025-01-08 23:51:02,501 INFO L78 Accepts]: Start accepts. Automaton has 138188 states and 143306 transitions. Word has length 597 [2025-01-08 23:51:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:02,501 INFO L471 AbstractCegarLoop]: Abstraction has 138188 states and 143306 transitions. [2025-01-08 23:51:02,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 138188 states and 143306 transitions. [2025-01-08 23:51:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-01-08 23:51:02,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:02,515 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:51:02,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:51:02,515 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:02,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:02,515 INFO L85 PathProgramCache]: Analyzing trace with hash -832204774, now seen corresponding path program 1 times [2025-01-08 23:51:02,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:02,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851909093] [2025-01-08 23:51:02,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:02,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:02,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-01-08 23:51:02,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-01-08 23:51:02,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:02,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2025-01-08 23:51:02,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:02,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851909093] [2025-01-08 23:51:02,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851909093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:02,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:02,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81275060] [2025-01-08 23:51:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:02,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:02,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:02,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:02,904 INFO L87 Difference]: Start difference. First operand 138188 states and 143306 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:05,427 INFO L93 Difference]: Finished difference Result 295900 states and 307487 transitions. [2025-01-08 23:51:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:05,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 645 [2025-01-08 23:51:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:05,633 INFO L225 Difference]: With dead ends: 295900 [2025-01-08 23:51:05,633 INFO L226 Difference]: Without dead ends: 158465 [2025-01-08 23:51:05,688 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-01-08 23:51:05,689 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 830 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:05,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1117 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-08 23:51:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158465 states. [2025-01-08 23:51:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158465 to 154710. [2025-01-08 23:51:07,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154710 states, 154709 states have (on average 1.0356087881118745) internal successors, (160218), 154709 states have internal predecessors, (160218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154710 states to 154710 states and 160218 transitions. [2025-01-08 23:51:07,383 INFO L78 Accepts]: Start accepts. Automaton has 154710 states and 160218 transitions. Word has length 645 [2025-01-08 23:51:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:07,384 INFO L471 AbstractCegarLoop]: Abstraction has 154710 states and 160218 transitions. [2025-01-08 23:51:07,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 154710 states and 160218 transitions. [2025-01-08 23:51:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-01-08 23:51:07,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:07,399 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:51:07,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 23:51:07,400 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:07,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:07,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1087678111, now seen corresponding path program 1 times [2025-01-08 23:51:07,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:07,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812373311] [2025-01-08 23:51:07,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:07,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:07,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-01-08 23:51:07,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-01-08 23:51:07,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:07,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 846 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-08 23:51:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:08,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812373311] [2025-01-08 23:51:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812373311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:08,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:08,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42194194] [2025-01-08 23:51:08,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:08,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:08,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:08,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:08,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:08,025 INFO L87 Difference]: Start difference. First operand 154710 states and 160218 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:10,602 INFO L93 Difference]: Finished difference Result 310920 states and 321940 transitions. [2025-01-08 23:51:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:10,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 680 [2025-01-08 23:51:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:10,777 INFO L225 Difference]: With dead ends: 310920 [2025-01-08 23:51:10,777 INFO L226 Difference]: Without dead ends: 156963 [2025-01-08 23:51:10,839 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-01-08 23:51:10,840 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 726 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:10,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 96 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-08 23:51:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156963 states. [2025-01-08 23:51:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156963 to 153959. [2025-01-08 23:51:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153959 states, 153958 states have (on average 1.032125644656335) internal successors, (158904), 153958 states have internal predecessors, (158904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153959 states to 153959 states and 158904 transitions. [2025-01-08 23:51:12,669 INFO L78 Accepts]: Start accepts. Automaton has 153959 states and 158904 transitions. Word has length 680 [2025-01-08 23:51:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:12,670 INFO L471 AbstractCegarLoop]: Abstraction has 153959 states and 158904 transitions. [2025-01-08 23:51:12,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 153959 states and 158904 transitions. [2025-01-08 23:51:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-01-08 23:51:12,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:12,692 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:51:12,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 23:51:12,692 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:12,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:12,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1051978519, now seen corresponding path program 1 times [2025-01-08 23:51:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:12,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741907809] [2025-01-08 23:51:12,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:12,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-01-08 23:51:12,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-01-08 23:51:12,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:12,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat