./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.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/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.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 eb34721bf39b8c345e8997284756581f81ddbf5d57990eeac4742dbd2546fd8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:51:25,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:51:26,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:51:26,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:51:26,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:51:26,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:51:26,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:51:26,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:51:26,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:51:26,076 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:51:26,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:51:26,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:51:26,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:51:26,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:51:26,077 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:51:26,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:51:26,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:51:26,078 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:51:26,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:51:26,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:51:26,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:51:26,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:51:26,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:51:26,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:51:26,078 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:51:26,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:51:26,079 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:51:26,079 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:51:26,079 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:51:26,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:51:26,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:51:26,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:51:26,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:51:26,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:51:26,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:51:26,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:51:26,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:51:26,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:51:26,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:51:26,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:51:26,080 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:51:26,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:51:26,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:51:26,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:51:26,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:51:26,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:51:26,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:51:26,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:51:26,081 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 -> eb34721bf39b8c345e8997284756581f81ddbf5d57990eeac4742dbd2546fd8d [2025-01-09 04:51:26,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:51:26,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:51:26,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:51:26,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:51:26,314 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:51:26,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-01-09 04:51:27,486 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b867a51f0/953c21efe2b647d2bc1350ea3cb53060/FLAGac9d5691d [2025-01-09 04:51:27,743 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:51:27,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-01-09 04:51:27,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b867a51f0/953c21efe2b647d2bc1350ea3cb53060/FLAGac9d5691d [2025-01-09 04:51:27,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b867a51f0/953c21efe2b647d2bc1350ea3cb53060 [2025-01-09 04:51:27,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:51:27,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:51:27,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:51:27,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:51:27,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:51:27,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:51:27" (1/1) ... [2025-01-09 04:51:27,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bab8108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:27, skipping insertion in model container [2025-01-09 04:51:27,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:51:27" (1/1) ... [2025-01-09 04:51:27,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:51:27,980 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/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7979,7992] [2025-01-09 04:51:28,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:51:28,047 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:51:28,076 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/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7979,7992] [2025-01-09 04:51:28,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:51:28,120 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:51:28,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28 WrapperNode [2025-01-09 04:51:28,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:51:28,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:51:28,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:51:28,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:51:28,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,186 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 686 [2025-01-09 04:51:28,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:51:28,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:51:28,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:51:28,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:51:28,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,218 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-09 04:51:28,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,224 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:51:28,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:51:28,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:51:28,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:51:28,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (1/1) ... [2025-01-09 04:51:28,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:51:28,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:51:28,260 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-09 04:51:28,262 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-09 04:51:28,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:51:28,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:51:28,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:51:28,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:51:28,363 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:51:28,364 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:51:28,912 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-01-09 04:51:28,912 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:51:28,924 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:51:28,924 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:51:28,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:51:28 BoogieIcfgContainer [2025-01-09 04:51:28,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:51:28,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:51:28,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:51:28,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:51:28,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:51:27" (1/3) ... [2025-01-09 04:51:28,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d54c79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:51:28, skipping insertion in model container [2025-01-09 04:51:28,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:28" (2/3) ... [2025-01-09 04:51:28,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d54c79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:51:28, skipping insertion in model container [2025-01-09 04:51:28,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:51:28" (3/3) ... [2025-01-09 04:51:28,933 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-01-09 04:51:28,944 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:51:28,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c that has 1 procedures, 150 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:51:28,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:51:28,997 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;@612e3fae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:51:28,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:51:29,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7567567567567568) internal successors, (260), 149 states have internal predecessors, (260), 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-09 04:51:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:51:29,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:29,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:29,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:29,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash -95572409, now seen corresponding path program 1 times [2025-01-09 04:51:29,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:29,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797910749] [2025-01-09 04:51:29,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:29,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:29,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:51:29,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:51:29,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:29,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:29,587 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-09 04:51:29,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:29,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797910749] [2025-01-09 04:51:29,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797910749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:29,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:29,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:51:29,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271897127] [2025-01-09 04:51:29,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:29,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:51:29,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:29,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:51:29,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:29,622 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7567567567567568) internal successors, (260), 149 states have internal predecessors, (260), 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 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-09 04:51:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:29,911 INFO L93 Difference]: Finished difference Result 845 states and 1355 transitions. [2025-01-09 04:51:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:51:29,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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 76 [2025-01-09 04:51:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:29,921 INFO L225 Difference]: With dead ends: 845 [2025-01-09 04:51:29,922 INFO L226 Difference]: Without dead ends: 751 [2025-01-09 04:51:29,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:51:29,929 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 1636 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:29,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1636 Valid, 1886 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:29,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-01-09 04:51:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 227. [2025-01-09 04:51:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 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-09 04:51:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2025-01-09 04:51:29,972 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 76 [2025-01-09 04:51:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:29,972 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2025-01-09 04:51:29,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-09 04:51:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2025-01-09 04:51:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:51:29,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:29,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:29,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:51:29,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:29,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:29,975 INFO L85 PathProgramCache]: Analyzing trace with hash -136563640, now seen corresponding path program 1 times [2025-01-09 04:51:29,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:29,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043745585] [2025-01-09 04:51:29,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:29,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:29,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:51:30,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:51:30,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:30,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:30,249 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-09 04:51:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043745585] [2025-01-09 04:51:30,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043745585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:30,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:30,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:51:30,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760873458] [2025-01-09 04:51:30,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:30,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:51:30,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:30,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:51:30,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:30,253 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-09 04:51:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:30,392 INFO L93 Difference]: Finished difference Result 922 states and 1419 transitions. [2025-01-09 04:51:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:51:30,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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 78 [2025-01-09 04:51:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:30,395 INFO L225 Difference]: With dead ends: 922 [2025-01-09 04:51:30,395 INFO L226 Difference]: Without dead ends: 802 [2025-01-09 04:51:30,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:51:30,396 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 1023 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:30,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1240 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-01-09 04:51:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 356. [2025-01-09 04:51:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 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-09 04:51:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 532 transitions. [2025-01-09 04:51:30,418 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 532 transitions. Word has length 78 [2025-01-09 04:51:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:30,419 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 532 transitions. [2025-01-09 04:51:30,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-09 04:51:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 532 transitions. [2025-01-09 04:51:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:51:30,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:30,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:30,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:51:30,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:30,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:30,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1646592496, now seen corresponding path program 1 times [2025-01-09 04:51:30,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:30,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852814903] [2025-01-09 04:51:30,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:30,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:30,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:51:30,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:51:30,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:30,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:30,625 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-09 04:51:30,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:30,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852814903] [2025-01-09 04:51:30,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852814903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:30,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:30,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:51:30,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125122411] [2025-01-09 04:51:30,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:30,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:51:30,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:30,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:51:30,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:30,626 INFO L87 Difference]: Start difference. First operand 356 states and 532 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-09 04:51:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:30,756 INFO L93 Difference]: Finished difference Result 1046 states and 1615 transitions. [2025-01-09 04:51:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:51:30,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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 78 [2025-01-09 04:51:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:30,760 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 04:51:30,760 INFO L226 Difference]: Without dead ends: 926 [2025-01-09 04:51:30,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:51:30,761 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 1287 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:30,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 1050 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-01-09 04:51:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 539. [2025-01-09 04:51:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 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-09 04:51:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 821 transitions. [2025-01-09 04:51:30,780 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 821 transitions. Word has length 78 [2025-01-09 04:51:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:30,780 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 821 transitions. [2025-01-09 04:51:30,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-09 04:51:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 821 transitions. [2025-01-09 04:51:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:51:30,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:30,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:30,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:51:30,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:30,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:30,785 INFO L85 PathProgramCache]: Analyzing trace with hash 641558373, now seen corresponding path program 1 times [2025-01-09 04:51:30,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:30,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400362643] [2025-01-09 04:51:30,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:30,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:30,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:51:30,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:51:30,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:30,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:31,119 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-09 04:51:31,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:31,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400362643] [2025-01-09 04:51:31,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400362643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:31,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:31,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:51:31,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837177531] [2025-01-09 04:51:31,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:31,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:51:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:31,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:51:31,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:31,120 INFO L87 Difference]: Start difference. First operand 539 states and 821 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-09 04:51:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:31,300 INFO L93 Difference]: Finished difference Result 956 states and 1478 transitions. [2025-01-09 04:51:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:51:31,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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 78 [2025-01-09 04:51:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:31,302 INFO L225 Difference]: With dead ends: 956 [2025-01-09 04:51:31,302 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 04:51:31,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:51:31,304 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 484 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:31,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 678 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 04:51:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2025-01-09 04:51:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 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-09 04:51:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 817 transitions. [2025-01-09 04:51:31,318 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 817 transitions. Word has length 78 [2025-01-09 04:51:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:31,319 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 817 transitions. [2025-01-09 04:51:31,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-09 04:51:31,319 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 817 transitions. [2025-01-09 04:51:31,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:51:31,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:31,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:31,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:51:31,322 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:31,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash 434659878, now seen corresponding path program 1 times [2025-01-09 04:51:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:31,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746119310] [2025-01-09 04:51:31,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:31,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:31,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:51:31,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:51:31,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:31,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:31,396 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-09 04:51:31,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:31,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746119310] [2025-01-09 04:51:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746119310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:31,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:31,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:51:31,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082171878] [2025-01-09 04:51:31,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:31,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:51:31,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:31,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:51:31,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:51:31,398 INFO L87 Difference]: Start difference. First operand 539 states and 817 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-09 04:51:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:31,417 INFO L93 Difference]: Finished difference Result 1324 states and 2046 transitions. [2025-01-09 04:51:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:51:31,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-01-09 04:51:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:31,420 INFO L225 Difference]: With dead ends: 1324 [2025-01-09 04:51:31,421 INFO L226 Difference]: Without dead ends: 909 [2025-01-09 04:51:31,421 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-09 04:51:31,424 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 83 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:31,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 470 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:51:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-01-09 04:51:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2025-01-09 04:51:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 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-09 04:51:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1379 transitions. [2025-01-09 04:51:31,450 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1379 transitions. Word has length 78 [2025-01-09 04:51:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:31,450 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1379 transitions. [2025-01-09 04:51:31,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-09 04:51:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1379 transitions. [2025-01-09 04:51:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:51:31,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:31,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:31,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:51:31,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:31,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash 450386228, now seen corresponding path program 1 times [2025-01-09 04:51:31,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:31,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281526498] [2025-01-09 04:51:31,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:31,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:31,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:51:31,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:51:31,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:31,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:31,583 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-09 04:51:31,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:31,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281526498] [2025-01-09 04:51:31,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281526498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:31,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:31,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:51:31,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955769909] [2025-01-09 04:51:31,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:31,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:51:31,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:31,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:51:31,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:31,584 INFO L87 Difference]: Start difference. First operand 907 states and 1379 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-09 04:51:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:31,735 INFO L93 Difference]: Finished difference Result 2058 states and 3161 transitions. [2025-01-09 04:51:31,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:51:31,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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 78 [2025-01-09 04:51:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:31,741 INFO L225 Difference]: With dead ends: 2058 [2025-01-09 04:51:31,741 INFO L226 Difference]: Without dead ends: 1833 [2025-01-09 04:51:31,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:51:31,742 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1032 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:31,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1387 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2025-01-09 04:51:31,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1131. [2025-01-09 04:51:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 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-09 04:51:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1726 transitions. [2025-01-09 04:51:31,769 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1726 transitions. Word has length 78 [2025-01-09 04:51:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:31,769 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1726 transitions. [2025-01-09 04:51:31,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-09 04:51:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1726 transitions. [2025-01-09 04:51:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:51:31,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:31,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:31,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:51:31,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:31,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:31,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1926158884, now seen corresponding path program 1 times [2025-01-09 04:51:31,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:31,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811960221] [2025-01-09 04:51:31,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:31,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:31,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:51:31,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:51:31,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:31,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:31,901 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-09 04:51:31,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:31,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811960221] [2025-01-09 04:51:31,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811960221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:31,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:31,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:51:31,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629094949] [2025-01-09 04:51:31,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:31,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:51:31,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:31,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:51:31,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:31,903 INFO L87 Difference]: Start difference. First operand 1131 states and 1726 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-09 04:51:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:32,036 INFO L93 Difference]: Finished difference Result 2292 states and 3524 transitions. [2025-01-09 04:51:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:51:32,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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 78 [2025-01-09 04:51:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:32,042 INFO L225 Difference]: With dead ends: 2292 [2025-01-09 04:51:32,043 INFO L226 Difference]: Without dead ends: 2067 [2025-01-09 04:51:32,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:51:32,044 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1077 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:32,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1595 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:32,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2025-01-09 04:51:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1370. [2025-01-09 04:51:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 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-09 04:51:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2097 transitions. [2025-01-09 04:51:32,095 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2097 transitions. Word has length 78 [2025-01-09 04:51:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:32,095 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 2097 transitions. [2025-01-09 04:51:32,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-09 04:51:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2097 transitions. [2025-01-09 04:51:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:51:32,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:32,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:32,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:51:32,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:32,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:32,097 INFO L85 PathProgramCache]: Analyzing trace with hash 100434268, now seen corresponding path program 1 times [2025-01-09 04:51:32,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:32,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674751791] [2025-01-09 04:51:32,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:32,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:32,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:51:32,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:51:32,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:32,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:32,213 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-09 04:51:32,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:32,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674751791] [2025-01-09 04:51:32,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674751791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:32,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:32,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:51:32,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550788488] [2025-01-09 04:51:32,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:32,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:51:32,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:32,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:51:32,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:32,214 INFO L87 Difference]: Start difference. First operand 1370 states and 2097 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-09 04:51:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:32,349 INFO L93 Difference]: Finished difference Result 2531 states and 3895 transitions. [2025-01-09 04:51:32,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:51:32,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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 78 [2025-01-09 04:51:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:32,357 INFO L225 Difference]: With dead ends: 2531 [2025-01-09 04:51:32,357 INFO L226 Difference]: Without dead ends: 2306 [2025-01-09 04:51:32,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:51:32,358 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 1081 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:32,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1257 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-01-09 04:51:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1609. [2025-01-09 04:51:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 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-09 04:51:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2468 transitions. [2025-01-09 04:51:32,406 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2468 transitions. Word has length 78 [2025-01-09 04:51:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:32,407 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2468 transitions. [2025-01-09 04:51:32,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-09 04:51:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2468 transitions. [2025-01-09 04:51:32,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:51:32,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:32,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:32,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:51:32,409 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:32,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1588436194, now seen corresponding path program 1 times [2025-01-09 04:51:32,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:32,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082695316] [2025-01-09 04:51:32,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:32,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:32,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:51:32,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:51:32,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:32,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:32,539 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-09 04:51:32,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:32,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082695316] [2025-01-09 04:51:32,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082695316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:32,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:32,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:51:32,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008518308] [2025-01-09 04:51:32,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:32,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:51:32,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:32,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:51:32,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:51:32,541 INFO L87 Difference]: Start difference. First operand 1609 states and 2468 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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-09 04:51:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:32,656 INFO L93 Difference]: Finished difference Result 3180 states and 4897 transitions. [2025-01-09 04:51:32,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:51:32,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-01-09 04:51:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:32,662 INFO L225 Difference]: With dead ends: 3180 [2025-01-09 04:51:32,662 INFO L226 Difference]: Without dead ends: 1609 [2025-01-09 04:51:32,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:32,665 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 554 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:32,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 110 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-01-09 04:51:32,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1609. [2025-01-09 04:51:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.5180348258706469) internal successors, (2441), 1608 states have internal predecessors, (2441), 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-09 04:51:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2441 transitions. [2025-01-09 04:51:32,692 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2441 transitions. Word has length 79 [2025-01-09 04:51:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:32,692 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2441 transitions. [2025-01-09 04:51:32,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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-09 04:51:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2441 transitions. [2025-01-09 04:51:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:51:32,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:32,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:32,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:51:32,693 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:32,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1613161725, now seen corresponding path program 1 times [2025-01-09 04:51:32,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600886454] [2025-01-09 04:51:32,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:32,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:32,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:51:32,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:51:32,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:32,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:32,775 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-09 04:51:32,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600886454] [2025-01-09 04:51:32,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600886454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:32,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:32,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:51:32,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736914912] [2025-01-09 04:51:32,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:32,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:51:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:32,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:51:32,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:51:32,776 INFO L87 Difference]: Start difference. First operand 1609 states and 2441 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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-09 04:51:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:32,898 INFO L93 Difference]: Finished difference Result 3164 states and 4824 transitions. [2025-01-09 04:51:32,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:51:32,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2025-01-09 04:51:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:32,902 INFO L225 Difference]: With dead ends: 3164 [2025-01-09 04:51:32,902 INFO L226 Difference]: Without dead ends: 1609 [2025-01-09 04:51:32,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:32,904 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 503 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:32,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 142 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-01-09 04:51:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1609. [2025-01-09 04:51:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.5012437810945274) internal successors, (2414), 1608 states have internal predecessors, (2414), 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-09 04:51:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2414 transitions. [2025-01-09 04:51:32,928 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2414 transitions. Word has length 80 [2025-01-09 04:51:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:32,928 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2414 transitions. [2025-01-09 04:51:32,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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-09 04:51:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2414 transitions. [2025-01-09 04:51:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:51:32,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:32,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:32,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:51:32,929 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash -105949250, now seen corresponding path program 1 times [2025-01-09 04:51:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383545506] [2025-01-09 04:51:32,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:32,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:51:32,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:51:32,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:32,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:33,006 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-09 04:51:33,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:33,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383545506] [2025-01-09 04:51:33,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383545506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:33,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:33,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:51:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967919942] [2025-01-09 04:51:33,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:33,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:51:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:33,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:51:33,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:51:33,008 INFO L87 Difference]: Start difference. First operand 1609 states and 2414 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-09 04:51:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:33,113 INFO L93 Difference]: Finished difference Result 3168 states and 4775 transitions. [2025-01-09 04:51:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:51:33,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-01-09 04:51:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:33,118 INFO L225 Difference]: With dead ends: 3168 [2025-01-09 04:51:33,118 INFO L226 Difference]: Without dead ends: 1609 [2025-01-09 04:51:33,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:33,120 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 508 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:33,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 134 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-01-09 04:51:33,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1609. [2025-01-09 04:51:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.484452736318408) internal successors, (2387), 1608 states have internal predecessors, (2387), 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-09 04:51:33,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2387 transitions. [2025-01-09 04:51:33,145 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2387 transitions. Word has length 81 [2025-01-09 04:51:33,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:33,145 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2387 transitions. [2025-01-09 04:51:33,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-09 04:51:33,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2387 transitions. [2025-01-09 04:51:33,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:51:33,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:33,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:33,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:51:33,147 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:33,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:33,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1094855209, now seen corresponding path program 1 times [2025-01-09 04:51:33,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:33,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799071445] [2025-01-09 04:51:33,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:33,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:33,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:51:33,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:51:33,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:33,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:33,222 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-09 04:51:33,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:33,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799071445] [2025-01-09 04:51:33,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799071445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:33,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:33,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:51:33,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720416303] [2025-01-09 04:51:33,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:33,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:51:33,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:33,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:51:33,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:51:33,224 INFO L87 Difference]: Start difference. First operand 1609 states and 2387 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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-09 04:51:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:33,347 INFO L93 Difference]: Finished difference Result 3176 states and 4731 transitions. [2025-01-09 04:51:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:51:33,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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 82 [2025-01-09 04:51:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:33,351 INFO L225 Difference]: With dead ends: 3176 [2025-01-09 04:51:33,352 INFO L226 Difference]: Without dead ends: 1609 [2025-01-09 04:51:33,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:33,354 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 524 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:33,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 118 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-01-09 04:51:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1609. [2025-01-09 04:51:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.4676616915422886) internal successors, (2360), 1608 states have internal predecessors, (2360), 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-09 04:51:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2360 transitions. [2025-01-09 04:51:33,377 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2360 transitions. Word has length 82 [2025-01-09 04:51:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:33,377 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2360 transitions. [2025-01-09 04:51:33,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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-09 04:51:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2360 transitions. [2025-01-09 04:51:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:51:33,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:33,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:33,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:51:33,379 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:33,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash -674687266, now seen corresponding path program 1 times [2025-01-09 04:51:33,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:33,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898613357] [2025-01-09 04:51:33,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:33,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:33,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:51:33,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:51:33,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:33,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:33,450 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-09 04:51:33,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:33,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898613357] [2025-01-09 04:51:33,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898613357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:33,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:33,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:51:33,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034721080] [2025-01-09 04:51:33,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:33,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:51:33,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:33,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:51:33,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:51:33,452 INFO L87 Difference]: Start difference. First operand 1609 states and 2360 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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-09 04:51:33,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:33,552 INFO L93 Difference]: Finished difference Result 3172 states and 4673 transitions. [2025-01-09 04:51:33,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:51:33,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2025-01-09 04:51:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:33,557 INFO L225 Difference]: With dead ends: 3172 [2025-01-09 04:51:33,557 INFO L226 Difference]: Without dead ends: 1609 [2025-01-09 04:51:33,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:33,559 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 506 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:33,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 126 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:33,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-01-09 04:51:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1609. [2025-01-09 04:51:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.4508706467661692) internal successors, (2333), 1608 states have internal predecessors, (2333), 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-09 04:51:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2333 transitions. [2025-01-09 04:51:33,583 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2333 transitions. Word has length 83 [2025-01-09 04:51:33,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:33,583 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2333 transitions. [2025-01-09 04:51:33,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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-09 04:51:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2333 transitions. [2025-01-09 04:51:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:51:33,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:33,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:33,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:51:33,585 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:33,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:33,585 INFO L85 PathProgramCache]: Analyzing trace with hash 340263851, now seen corresponding path program 1 times [2025-01-09 04:51:33,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:33,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049312321] [2025-01-09 04:51:33,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:33,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:33,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:51:33,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:51:33,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:33,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:33,960 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-09 04:51:33,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:33,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049312321] [2025-01-09 04:51:33,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049312321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:33,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:33,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:51:33,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530609634] [2025-01-09 04:51:33,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:33,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:51:33,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:33,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:51:33,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:51:33,962 INFO L87 Difference]: Start difference. First operand 1609 states and 2333 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 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-09 04:51:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:34,519 INFO L93 Difference]: Finished difference Result 4602 states and 6681 transitions. [2025-01-09 04:51:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:51:34,519 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 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 84 [2025-01-09 04:51:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:34,527 INFO L225 Difference]: With dead ends: 4602 [2025-01-09 04:51:34,528 INFO L226 Difference]: Without dead ends: 3144 [2025-01-09 04:51:34,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:51:34,531 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 652 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:34,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 562 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:51:34,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2025-01-09 04:51:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 1609. [2025-01-09 04:51:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.447139303482587) internal successors, (2327), 1608 states have internal predecessors, (2327), 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-09 04:51:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2327 transitions. [2025-01-09 04:51:34,571 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2327 transitions. Word has length 84 [2025-01-09 04:51:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:34,571 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2327 transitions. [2025-01-09 04:51:34,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 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-09 04:51:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2327 transitions. [2025-01-09 04:51:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:51:34,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:34,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:34,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:51:34,572 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:34,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:34,572 INFO L85 PathProgramCache]: Analyzing trace with hash -627321848, now seen corresponding path program 1 times [2025-01-09 04:51:34,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:34,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078068129] [2025-01-09 04:51:34,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:34,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:51:34,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:51:34,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:34,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:34,966 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-09 04:51:34,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078068129] [2025-01-09 04:51:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078068129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:34,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:34,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:51:34,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122107454] [2025-01-09 04:51:34,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:34,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:51:34,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:34,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:51:34,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:51:34,968 INFO L87 Difference]: Start difference. First operand 1609 states and 2327 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 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-09 04:51:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:35,481 INFO L93 Difference]: Finished difference Result 4692 states and 6809 transitions. [2025-01-09 04:51:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:51:35,482 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 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 85 [2025-01-09 04:51:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:35,490 INFO L225 Difference]: With dead ends: 4692 [2025-01-09 04:51:35,490 INFO L226 Difference]: Without dead ends: 3179 [2025-01-09 04:51:35,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:51:35,493 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 846 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:35,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 640 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:51:35,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2025-01-09 04:51:35,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 1609. [2025-01-09 04:51:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.4458955223880596) internal successors, (2325), 1608 states have internal predecessors, (2325), 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-09 04:51:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2325 transitions. [2025-01-09 04:51:35,525 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2325 transitions. Word has length 85 [2025-01-09 04:51:35,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:35,526 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2325 transitions. [2025-01-09 04:51:35,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 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-09 04:51:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2325 transitions. [2025-01-09 04:51:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:51:35,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:35,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:35,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:51:35,527 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:35,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:35,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1853534364, now seen corresponding path program 1 times [2025-01-09 04:51:35,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:35,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660069021] [2025-01-09 04:51:35,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:35,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:35,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:51:35,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:51:35,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:35,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:35,816 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-09 04:51:35,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660069021] [2025-01-09 04:51:35,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660069021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:35,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:35,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:51:35,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811182061] [2025-01-09 04:51:35,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:35,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:51:35,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:35,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:51:35,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:51:35,818 INFO L87 Difference]: Start difference. First operand 1609 states and 2325 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 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-09 04:51:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:36,124 INFO L93 Difference]: Finished difference Result 4585 states and 6671 transitions. [2025-01-09 04:51:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:51:36,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 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 85 [2025-01-09 04:51:36,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:36,130 INFO L225 Difference]: With dead ends: 4585 [2025-01-09 04:51:36,131 INFO L226 Difference]: Without dead ends: 3067 [2025-01-09 04:51:36,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:51:36,133 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 773 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:36,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 593 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:51:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2025-01-09 04:51:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 1609. [2025-01-09 04:51:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.445273631840796) internal successors, (2324), 1608 states have internal predecessors, (2324), 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-09 04:51:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2324 transitions. [2025-01-09 04:51:36,168 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2324 transitions. Word has length 85 [2025-01-09 04:51:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:36,168 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2324 transitions. [2025-01-09 04:51:36,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 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-09 04:51:36,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2324 transitions. [2025-01-09 04:51:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:51:36,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:36,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:36,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:51:36,169 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:36,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash -337986815, now seen corresponding path program 1 times [2025-01-09 04:51:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:36,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901789114] [2025-01-09 04:51:36,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:36,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:36,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:51:36,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:51:36,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:36,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:36,428 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-09 04:51:36,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:36,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901789114] [2025-01-09 04:51:36,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901789114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:36,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:36,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:51:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243287263] [2025-01-09 04:51:36,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:36,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:51:36,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:36,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:51:36,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:51:36,430 INFO L87 Difference]: Start difference. First operand 1609 states and 2324 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 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-09 04:51:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:36,921 INFO L93 Difference]: Finished difference Result 4677 states and 6782 transitions. [2025-01-09 04:51:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:51:36,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 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 86 [2025-01-09 04:51:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:36,927 INFO L225 Difference]: With dead ends: 4677 [2025-01-09 04:51:36,927 INFO L226 Difference]: Without dead ends: 3174 [2025-01-09 04:51:36,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:51:36,929 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 760 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:36,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 944 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:51:36,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2025-01-09 04:51:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 1609. [2025-01-09 04:51:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.4427860696517414) internal successors, (2320), 1608 states have internal predecessors, (2320), 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-09 04:51:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2320 transitions. [2025-01-09 04:51:36,958 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2320 transitions. Word has length 86 [2025-01-09 04:51:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:36,959 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2320 transitions. [2025-01-09 04:51:36,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 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-09 04:51:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2320 transitions. [2025-01-09 04:51:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:51:36,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:36,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:36,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:51:36,960 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash 135072209, now seen corresponding path program 1 times [2025-01-09 04:51:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:36,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893566347] [2025-01-09 04:51:36,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:36,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:51:36,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:51:36,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:36,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:37,225 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-09 04:51:37,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:37,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893566347] [2025-01-09 04:51:37,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893566347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:37,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:37,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:51:37,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916988196] [2025-01-09 04:51:37,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:37,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:51:37,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:37,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:51:37,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:51:37,227 INFO L87 Difference]: Start difference. First operand 1609 states and 2320 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 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-09 04:51:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:37,607 INFO L93 Difference]: Finished difference Result 4647 states and 6730 transitions. [2025-01-09 04:51:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:51:37,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 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 87 [2025-01-09 04:51:37,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:37,614 INFO L225 Difference]: With dead ends: 4647 [2025-01-09 04:51:37,615 INFO L226 Difference]: Without dead ends: 3164 [2025-01-09 04:51:37,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:51:37,618 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 730 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:37,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 564 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:51:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2025-01-09 04:51:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 1609. [2025-01-09 04:51:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.439676616915423) internal successors, (2315), 1608 states have internal predecessors, (2315), 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-09 04:51:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2315 transitions. [2025-01-09 04:51:37,648 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2315 transitions. Word has length 87 [2025-01-09 04:51:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:37,649 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2315 transitions. [2025-01-09 04:51:37,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 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-09 04:51:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2315 transitions. [2025-01-09 04:51:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:51:37,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:37,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:37,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:51:37,650 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:37,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:37,650 INFO L85 PathProgramCache]: Analyzing trace with hash -479617813, now seen corresponding path program 1 times [2025-01-09 04:51:37,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:37,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372793310] [2025-01-09 04:51:37,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:37,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:37,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:51:37,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:51:37,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:37,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:38,182 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-09 04:51:38,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:38,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372793310] [2025-01-09 04:51:38,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372793310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:38,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:38,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:51:38,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825328419] [2025-01-09 04:51:38,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:38,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:51:38,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:38,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:51:38,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:51:38,183 INFO L87 Difference]: Start difference. First operand 1609 states and 2315 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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-09 04:51:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:38,742 INFO L93 Difference]: Finished difference Result 3565 states and 5168 transitions. [2025-01-09 04:51:38,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:51:38,742 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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 88 [2025-01-09 04:51:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:38,747 INFO L225 Difference]: With dead ends: 3565 [2025-01-09 04:51:38,747 INFO L226 Difference]: Without dead ends: 3095 [2025-01-09 04:51:38,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:51:38,749 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 686 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:38,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1531 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:51:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2025-01-09 04:51:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 1598. [2025-01-09 04:51:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1597 states have (on average 1.4376956793988729) internal successors, (2296), 1597 states have internal predecessors, (2296), 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-09 04:51:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2296 transitions. [2025-01-09 04:51:38,781 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2296 transitions. Word has length 88 [2025-01-09 04:51:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:38,784 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2296 transitions. [2025-01-09 04:51:38,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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-09 04:51:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2296 transitions. [2025-01-09 04:51:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:51:38,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:38,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:38,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:51:38,786 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:38,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash -949937908, now seen corresponding path program 1 times [2025-01-09 04:51:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:38,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830079202] [2025-01-09 04:51:38,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:38,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:38,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:51:38,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:51:38,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:38,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:39,337 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-09 04:51:39,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:39,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830079202] [2025-01-09 04:51:39,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830079202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:39,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:39,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:51:39,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980509156] [2025-01-09 04:51:39,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:39,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:51:39,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:39,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:51:39,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:51:39,338 INFO L87 Difference]: Start difference. First operand 1598 states and 2296 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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-09 04:51:39,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:39,997 INFO L93 Difference]: Finished difference Result 6436 states and 9359 transitions. [2025-01-09 04:51:39,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:51:39,997 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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 88 [2025-01-09 04:51:39,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:40,007 INFO L225 Difference]: With dead ends: 6436 [2025-01-09 04:51:40,007 INFO L226 Difference]: Without dead ends: 5986 [2025-01-09 04:51:40,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:51:40,010 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 964 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:40,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 2129 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:51:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2025-01-09 04:51:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 1597. [2025-01-09 04:51:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1596 states have (on average 1.4348370927318295) internal successors, (2290), 1596 states have internal predecessors, (2290), 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-09 04:51:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2290 transitions. [2025-01-09 04:51:40,081 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2290 transitions. Word has length 88 [2025-01-09 04:51:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:40,081 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2290 transitions. [2025-01-09 04:51:40,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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-09 04:51:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2290 transitions. [2025-01-09 04:51:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:51:40,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:40,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:40,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:51:40,083 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:40,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash 373302795, now seen corresponding path program 1 times [2025-01-09 04:51:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:40,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296940147] [2025-01-09 04:51:40,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:40,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:51:40,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:51:40,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:40,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:40,557 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-09 04:51:40,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:40,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296940147] [2025-01-09 04:51:40,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296940147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:40,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:40,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:51:40,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358968295] [2025-01-09 04:51:40,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:40,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:51:40,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:40,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:51:40,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:51:40,559 INFO L87 Difference]: Start difference. First operand 1597 states and 2290 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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-09 04:51:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:41,219 INFO L93 Difference]: Finished difference Result 6500 states and 9433 transitions. [2025-01-09 04:51:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:51:41,220 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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 88 [2025-01-09 04:51:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:41,228 INFO L225 Difference]: With dead ends: 6500 [2025-01-09 04:51:41,228 INFO L226 Difference]: Without dead ends: 6020 [2025-01-09 04:51:41,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:51:41,231 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 1156 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:41,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 2505 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:51:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2025-01-09 04:51:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 1571. [2025-01-09 04:51:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1570 states have (on average 1.4363057324840764) internal successors, (2255), 1570 states have internal predecessors, (2255), 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-09 04:51:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2255 transitions. [2025-01-09 04:51:41,271 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2255 transitions. Word has length 88 [2025-01-09 04:51:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:41,271 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2255 transitions. [2025-01-09 04:51:41,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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-09 04:51:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2255 transitions. [2025-01-09 04:51:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:51:41,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:41,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:41,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:51:41,272 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:41,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:41,273 INFO L85 PathProgramCache]: Analyzing trace with hash -450290966, now seen corresponding path program 1 times [2025-01-09 04:51:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:41,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784777149] [2025-01-09 04:51:41,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:41,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:51:41,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:51:41,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:41,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:41,647 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-09 04:51:41,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:41,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784777149] [2025-01-09 04:51:41,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784777149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:41,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:41,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:51:41,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775378567] [2025-01-09 04:51:41,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:41,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:51:41,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:41,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:51:41,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:51:41,649 INFO L87 Difference]: Start difference. First operand 1571 states and 2255 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-09 04:51:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:42,105 INFO L93 Difference]: Finished difference Result 6406 states and 9313 transitions. [2025-01-09 04:51:42,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:51:42,106 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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 88 [2025-01-09 04:51:42,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:42,115 INFO L225 Difference]: With dead ends: 6406 [2025-01-09 04:51:42,115 INFO L226 Difference]: Without dead ends: 5931 [2025-01-09 04:51:42,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:51:42,118 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 774 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:42,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2591 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:51:42,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2025-01-09 04:51:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 1544. [2025-01-09 04:51:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 1.4394037589112119) internal successors, (2221), 1543 states have internal predecessors, (2221), 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-09 04:51:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2221 transitions. [2025-01-09 04:51:42,155 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2221 transitions. Word has length 88 [2025-01-09 04:51:42,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:42,155 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2221 transitions. [2025-01-09 04:51:42,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 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-09 04:51:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2221 transitions. [2025-01-09 04:51:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:51:42,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:42,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:42,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:51:42,156 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:42,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1982234760, now seen corresponding path program 1 times [2025-01-09 04:51:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:42,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178677926] [2025-01-09 04:51:42,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:42,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:42,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:51:42,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:51:42,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:42,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:42,310 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-09 04:51:42,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:42,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178677926] [2025-01-09 04:51:42,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178677926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:42,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:42,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:51:42,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791337568] [2025-01-09 04:51:42,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:42,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:51:42,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:42,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:51:42,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:51:42,312 INFO L87 Difference]: Start difference. First operand 1544 states and 2221 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-09 04:51:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:42,332 INFO L93 Difference]: Finished difference Result 1558 states and 2240 transitions. [2025-01-09 04:51:42,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:51:42,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 89 [2025-01-09 04:51:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:42,335 INFO L225 Difference]: With dead ends: 1558 [2025-01-09 04:51:42,335 INFO L226 Difference]: Without dead ends: 1556 [2025-01-09 04:51:42,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:51:42,336 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:42,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 705 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:51:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2025-01-09 04:51:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2025-01-09 04:51:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1555 states have (on average 1.4315112540192927) internal successors, (2226), 1555 states have internal predecessors, (2226), 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-09 04:51:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2226 transitions. [2025-01-09 04:51:42,349 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2226 transitions. Word has length 89 [2025-01-09 04:51:42,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:42,349 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2226 transitions. [2025-01-09 04:51:42,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-09 04:51:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2226 transitions. [2025-01-09 04:51:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:51:42,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:42,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:42,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:51:42,351 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:42,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:42,351 INFO L85 PathProgramCache]: Analyzing trace with hash 392224756, now seen corresponding path program 1 times [2025-01-09 04:51:42,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:42,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608696307] [2025-01-09 04:51:42,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:42,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:51:42,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:51:42,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:42,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:42,443 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-09 04:51:42,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:42,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608696307] [2025-01-09 04:51:42,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608696307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:42,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:42,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:51:42,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962937559] [2025-01-09 04:51:42,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:42,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:51:42,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:42,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:51:42,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:51:42,445 INFO L87 Difference]: Start difference. First operand 1556 states and 2226 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-09 04:51:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:42,465 INFO L93 Difference]: Finished difference Result 3611 states and 5213 transitions. [2025-01-09 04:51:42,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:51:42,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 89 [2025-01-09 04:51:42,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:42,468 INFO L225 Difference]: With dead ends: 3611 [2025-01-09 04:51:42,468 INFO L226 Difference]: Without dead ends: 2147 [2025-01-09 04:51:42,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:51:42,470 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 88 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:42,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 432 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:51:42,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2025-01-09 04:51:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2145. [2025-01-09 04:51:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2144 states have (on average 1.4309701492537314) internal successors, (3068), 2144 states have internal predecessors, (3068), 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-09 04:51:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3068 transitions. [2025-01-09 04:51:42,493 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3068 transitions. Word has length 89 [2025-01-09 04:51:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:42,493 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 3068 transitions. [2025-01-09 04:51:42,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-09 04:51:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3068 transitions. [2025-01-09 04:51:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:51:42,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:42,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:42,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:51:42,494 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:42,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1189107016, now seen corresponding path program 1 times [2025-01-09 04:51:42,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:42,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014419105] [2025-01-09 04:51:42,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:42,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:42,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:51:42,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:51:42,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:42,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:43,837 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-09 04:51:43,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:43,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014419105] [2025-01-09 04:51:43,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014419105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:43,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:43,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-01-09 04:51:43,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783701272] [2025-01-09 04:51:43,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:43,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 04:51:43,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:43,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 04:51:43,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2025-01-09 04:51:43,840 INFO L87 Difference]: Start difference. First operand 2145 states and 3068 transitions. Second operand has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 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-09 04:51:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:47,999 INFO L93 Difference]: Finished difference Result 14559 states and 20999 transitions. [2025-01-09 04:51:48,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 04:51:48,000 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 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 89 [2025-01-09 04:51:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:48,018 INFO L225 Difference]: With dead ends: 14559 [2025-01-09 04:51:48,018 INFO L226 Difference]: Without dead ends: 12504 [2025-01-09 04:51:48,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=492, Invalid=2814, Unknown=0, NotChecked=0, Total=3306 [2025-01-09 04:51:48,024 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 1452 mSDsluCounter, 8727 mSDsCounter, 0 mSdLazyCounter, 5990 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 9250 SdHoareTripleChecker+Invalid, 6009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:48,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 9250 Invalid, 6009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5990 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 04:51:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12504 states. [2025-01-09 04:51:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12504 to 2166. [2025-01-09 04:51:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 2165 states have (on average 1.4286374133949191) internal successors, (3093), 2165 states have internal predecessors, (3093), 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-09 04:51:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 3093 transitions. [2025-01-09 04:51:48,096 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 3093 transitions. Word has length 89 [2025-01-09 04:51:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:48,096 INFO L471 AbstractCegarLoop]: Abstraction has 2166 states and 3093 transitions. [2025-01-09 04:51:48,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 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-09 04:51:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 3093 transitions. [2025-01-09 04:51:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:51:48,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:48,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:48,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:51:48,098 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:48,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1595507144, now seen corresponding path program 1 times [2025-01-09 04:51:48,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:48,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126593144] [2025-01-09 04:51:48,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:48,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:48,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:51:48,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:51:48,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:48,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:48,462 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-09 04:51:48,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:48,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126593144] [2025-01-09 04:51:48,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126593144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:48,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:48,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:51:48,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183938554] [2025-01-09 04:51:48,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:48,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:51:48,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:48,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:51:48,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:51:48,464 INFO L87 Difference]: Start difference. First operand 2166 states and 3093 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 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-09 04:51:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:48,788 INFO L93 Difference]: Finished difference Result 4896 states and 7040 transitions. [2025-01-09 04:51:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:51:48,789 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 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 90 [2025-01-09 04:51:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:48,795 INFO L225 Difference]: With dead ends: 4896 [2025-01-09 04:51:48,795 INFO L226 Difference]: Without dead ends: 4220 [2025-01-09 04:51:48,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:51:48,798 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 270 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:48,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 947 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:48,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2025-01-09 04:51:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 2155. [2025-01-09 04:51:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.4294336118848654) internal successors, (3079), 2154 states have internal predecessors, (3079), 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-09 04:51:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 3079 transitions. [2025-01-09 04:51:48,824 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 3079 transitions. Word has length 90 [2025-01-09 04:51:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:48,824 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 3079 transitions. [2025-01-09 04:51:48,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 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-09 04:51:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3079 transitions. [2025-01-09 04:51:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 04:51:48,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:48,825 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-01-09 04:51:48,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:51:48,827 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:48,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:48,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1571867660, now seen corresponding path program 1 times [2025-01-09 04:51:48,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:48,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506603058] [2025-01-09 04:51:48,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:48,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 04:51:48,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 04:51:48,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:48,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:48,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:48,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506603058] [2025-01-09 04:51:48,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506603058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:48,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:48,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:51:48,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12957983] [2025-01-09 04:51:48,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:48,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:51:48,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:48,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:51:48,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:51:48,917 INFO L87 Difference]: Start difference. First operand 2155 states and 3079 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-09 04:51:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:48,937 INFO L93 Difference]: Finished difference Result 4472 states and 6424 transitions. [2025-01-09 04:51:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:51:48,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 118 [2025-01-09 04:51:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:48,941 INFO L225 Difference]: With dead ends: 4472 [2025-01-09 04:51:48,942 INFO L226 Difference]: Without dead ends: 3008 [2025-01-09 04:51:48,943 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-09 04:51:48,944 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 81 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:48,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 393 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:51:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-01-09 04:51:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2898. [2025-01-09 04:51:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2897 states have (on average 1.4269934414911978) internal successors, (4134), 2897 states have internal predecessors, (4134), 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-09 04:51:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4134 transitions. [2025-01-09 04:51:48,974 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4134 transitions. Word has length 118 [2025-01-09 04:51:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:48,974 INFO L471 AbstractCegarLoop]: Abstraction has 2898 states and 4134 transitions. [2025-01-09 04:51:48,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-09 04:51:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4134 transitions. [2025-01-09 04:51:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 04:51:48,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:48,976 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:48,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:51:48,976 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:48,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1846302245, now seen corresponding path program 1 times [2025-01-09 04:51:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:48,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669767674] [2025-01-09 04:51:48,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:48,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 04:51:48,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 04:51:48,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:48,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:49,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:49,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669767674] [2025-01-09 04:51:49,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669767674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:49,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:49,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:51:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373066975] [2025-01-09 04:51:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:49,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:51:49,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:49,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:51:49,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:49,099 INFO L87 Difference]: Start difference. First operand 2898 states and 4134 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 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-09 04:51:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:49,340 INFO L93 Difference]: Finished difference Result 10572 states and 15264 transitions. [2025-01-09 04:51:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:51:49,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 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 120 [2025-01-09 04:51:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:49,354 INFO L225 Difference]: With dead ends: 10572 [2025-01-09 04:51:49,354 INFO L226 Difference]: Without dead ends: 7785 [2025-01-09 04:51:49,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:51:49,360 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 926 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:49,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 340 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:51:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7785 states. [2025-01-09 04:51:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7785 to 6183. [2025-01-09 04:51:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6183 states, 6182 states have (on average 1.431252021999353) internal successors, (8848), 6182 states have internal predecessors, (8848), 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-09 04:51:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 8848 transitions. [2025-01-09 04:51:49,456 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 8848 transitions. Word has length 120 [2025-01-09 04:51:49,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:49,456 INFO L471 AbstractCegarLoop]: Abstraction has 6183 states and 8848 transitions. [2025-01-09 04:51:49,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 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-09 04:51:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 8848 transitions. [2025-01-09 04:51:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 04:51:49,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:49,458 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-01-09 04:51:49,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:51:49,458 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:49,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:49,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1365249350, now seen corresponding path program 1 times [2025-01-09 04:51:49,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:49,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368902232] [2025-01-09 04:51:49,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:49,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:49,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 04:51:49,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 04:51:49,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:49,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:49,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:49,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368902232] [2025-01-09 04:51:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368902232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:49,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:49,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:51:49,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009678197] [2025-01-09 04:51:49,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:49,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:51:49,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:49,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:51:49,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:49,561 INFO L87 Difference]: Start difference. First operand 6183 states and 8848 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 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-09 04:51:49,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:49,779 INFO L93 Difference]: Finished difference Result 20527 states and 29506 transitions. [2025-01-09 04:51:49,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:51:49,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 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 120 [2025-01-09 04:51:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:49,801 INFO L225 Difference]: With dead ends: 20527 [2025-01-09 04:51:49,801 INFO L226 Difference]: Without dead ends: 14455 [2025-01-09 04:51:49,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:51:49,811 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 841 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:49,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 338 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14455 states. [2025-01-09 04:51:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14455 to 13253. [2025-01-09 04:51:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13253 states, 13252 states have (on average 1.4319348022939933) internal successors, (18976), 13252 states have internal predecessors, (18976), 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-09 04:51:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13253 states to 13253 states and 18976 transitions. [2025-01-09 04:51:50,043 INFO L78 Accepts]: Start accepts. Automaton has 13253 states and 18976 transitions. Word has length 120 [2025-01-09 04:51:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:50,043 INFO L471 AbstractCegarLoop]: Abstraction has 13253 states and 18976 transitions. [2025-01-09 04:51:50,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 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-09 04:51:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 13253 states and 18976 transitions. [2025-01-09 04:51:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 04:51:50,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:50,045 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-01-09 04:51:50,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:51:50,045 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:50,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1045571118, now seen corresponding path program 1 times [2025-01-09 04:51:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:50,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109705147] [2025-01-09 04:51:50,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:50,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:50,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 04:51:50,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 04:51:50,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:50,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:50,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:50,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109705147] [2025-01-09 04:51:50,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109705147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:50,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:50,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:51:50,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037911434] [2025-01-09 04:51:50,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:50,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:51:50,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:50,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:51:50,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:50,145 INFO L87 Difference]: Start difference. First operand 13253 states and 18976 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 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-09 04:51:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:50,395 INFO L93 Difference]: Finished difference Result 49537 states and 71490 transitions. [2025-01-09 04:51:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:51:50,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 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 120 [2025-01-09 04:51:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:50,445 INFO L225 Difference]: With dead ends: 49537 [2025-01-09 04:51:50,445 INFO L226 Difference]: Without dead ends: 36395 [2025-01-09 04:51:50,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:51:50,464 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1011 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:50,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 342 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:51:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36395 states. [2025-01-09 04:51:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36395 to 28393. [2025-01-09 04:51:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28393 states, 28392 states have (on average 1.4311073541842774) internal successors, (40632), 28392 states have internal predecessors, (40632), 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-09 04:51:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28393 states to 28393 states and 40632 transitions. [2025-01-09 04:51:50,830 INFO L78 Accepts]: Start accepts. Automaton has 28393 states and 40632 transitions. Word has length 120 [2025-01-09 04:51:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:50,830 INFO L471 AbstractCegarLoop]: Abstraction has 28393 states and 40632 transitions. [2025-01-09 04:51:50,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 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-09 04:51:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 28393 states and 40632 transitions. [2025-01-09 04:51:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 04:51:50,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:50,832 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-01-09 04:51:50,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:51:50,832 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:50,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash 920112344, now seen corresponding path program 1 times [2025-01-09 04:51:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:50,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135864084] [2025-01-09 04:51:50,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:50,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:50,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 04:51:50,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 04:51:50,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:50,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:50,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:50,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135864084] [2025-01-09 04:51:50,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135864084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:50,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:50,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:51:50,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703683660] [2025-01-09 04:51:50,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:50,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:51:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:50,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:51:50,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:51:50,927 INFO L87 Difference]: Start difference. First operand 28393 states and 40632 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 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-09 04:51:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:51,341 INFO L93 Difference]: Finished difference Result 64360 states and 92288 transitions. [2025-01-09 04:51:51,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:51:51,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 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 120 [2025-01-09 04:51:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:51,383 INFO L225 Difference]: With dead ends: 64360 [2025-01-09 04:51:51,383 INFO L226 Difference]: Without dead ends: 36078 [2025-01-09 04:51:51,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:51:51,400 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 895 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:51,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 390 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:51:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36078 states. [2025-01-09 04:51:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36078 to 30274. [2025-01-09 04:51:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30274 states, 30273 states have (on average 1.425032206917055) internal successors, (43140), 30273 states have internal predecessors, (43140), 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-09 04:51:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30274 states to 30274 states and 43140 transitions. [2025-01-09 04:51:51,827 INFO L78 Accepts]: Start accepts. Automaton has 30274 states and 43140 transitions. Word has length 120 [2025-01-09 04:51:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:51,827 INFO L471 AbstractCegarLoop]: Abstraction has 30274 states and 43140 transitions. [2025-01-09 04:51:51,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 6 states have internal predecessors, (120), 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-09 04:51:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 30274 states and 43140 transitions. [2025-01-09 04:51:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 04:51:51,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:51,833 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:51:51,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:51:51,833 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:51,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:51,833 INFO L85 PathProgramCache]: Analyzing trace with hash -57380458, now seen corresponding path program 1 times [2025-01-09 04:51:51,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:51,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619034466] [2025-01-09 04:51:51,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:51,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 04:51:51,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 04:51:51,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:51,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 04:51:51,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619034466] [2025-01-09 04:51:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619034466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:51,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:51,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:51:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42108683] [2025-01-09 04:51:51,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:51,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:51:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:51,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:51:51,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:51:51,951 INFO L87 Difference]: Start difference. First operand 30274 states and 43140 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-09 04:51:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:52,080 INFO L93 Difference]: Finished difference Result 58318 states and 82934 transitions. [2025-01-09 04:51:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:51:52,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 147 [2025-01-09 04:51:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:52,118 INFO L225 Difference]: With dead ends: 58318 [2025-01-09 04:51:52,119 INFO L226 Difference]: Without dead ends: 28161 [2025-01-09 04:51:52,144 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-09 04:51:52,146 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 74 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:52,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 382 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:51:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28161 states. [2025-01-09 04:51:52,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28161 to 27529. [2025-01-09 04:51:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27529 states, 27528 states have (on average 1.4123801220575414) internal successors, (38880), 27528 states have internal predecessors, (38880), 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-09 04:51:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27529 states to 27529 states and 38880 transitions. [2025-01-09 04:51:52,568 INFO L78 Accepts]: Start accepts. Automaton has 27529 states and 38880 transitions. Word has length 147 [2025-01-09 04:51:52,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:52,568 INFO L471 AbstractCegarLoop]: Abstraction has 27529 states and 38880 transitions. [2025-01-09 04:51:52,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-09 04:51:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 27529 states and 38880 transitions. [2025-01-09 04:51:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 04:51:52,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:52,574 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-01-09 04:51:52,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:51:52,574 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:52,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:52,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1691562909, now seen corresponding path program 1 times [2025-01-09 04:51:52,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:52,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794824430] [2025-01-09 04:51:52,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:52,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:52,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 04:51:52,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 04:51:52,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:52,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 04:51:52,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:52,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794824430] [2025-01-09 04:51:52,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794824430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:52,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:52,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:51:52,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173008438] [2025-01-09 04:51:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:52,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:51:52,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:52,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:51:52,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:51:52,657 INFO L87 Difference]: Start difference. First operand 27529 states and 38880 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-09 04:51:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:52,773 INFO L93 Difference]: Finished difference Result 52849 states and 74442 transitions. [2025-01-09 04:51:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:51:52,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 148 [2025-01-09 04:51:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:52,803 INFO L225 Difference]: With dead ends: 52849 [2025-01-09 04:51:52,803 INFO L226 Difference]: Without dead ends: 25431 [2025-01-09 04:51:52,824 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-09 04:51:52,824 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 68 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:52,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 383 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:51:52,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25431 states. [2025-01-09 04:51:53,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25431 to 24829. [2025-01-09 04:51:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24829 states, 24828 states have (on average 1.3968100531657806) internal successors, (34680), 24828 states have internal predecessors, (34680), 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-09 04:51:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24829 states to 24829 states and 34680 transitions. [2025-01-09 04:51:53,179 INFO L78 Accepts]: Start accepts. Automaton has 24829 states and 34680 transitions. Word has length 148 [2025-01-09 04:51:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:53,179 INFO L471 AbstractCegarLoop]: Abstraction has 24829 states and 34680 transitions. [2025-01-09 04:51:53,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-09 04:51:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 24829 states and 34680 transitions. [2025-01-09 04:51:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:51:53,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:53,183 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-01-09 04:51:53,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:51:53,184 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:53,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:53,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1473875707, now seen corresponding path program 1 times [2025-01-09 04:51:53,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:53,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283888678] [2025-01-09 04:51:53,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:53,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:53,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:51:53,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:51:53,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:53,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:51:53,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:53,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283888678] [2025-01-09 04:51:53,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283888678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:53,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:53,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:51:53,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113317843] [2025-01-09 04:51:53,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:53,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:51:53,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:53,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:51:53,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:51:53,258 INFO L87 Difference]: Start difference. First operand 24829 states and 34680 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-09 04:51:53,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:53,344 INFO L93 Difference]: Finished difference Result 47449 states and 66042 transitions. [2025-01-09 04:51:53,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:51:53,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 149 [2025-01-09 04:51:53,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:53,463 INFO L225 Difference]: With dead ends: 47449 [2025-01-09 04:51:53,463 INFO L226 Difference]: Without dead ends: 22731 [2025-01-09 04:51:53,471 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-09 04:51:53,471 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 61 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:53,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 384 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:51:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22731 states. [2025-01-09 04:51:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22731 to 22129. [2025-01-09 04:51:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22129 states, 22128 states have (on average 1.3774403470715835) internal successors, (30480), 22128 states have internal predecessors, (30480), 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-09 04:51:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22129 states to 22129 states and 30480 transitions. [2025-01-09 04:51:53,656 INFO L78 Accepts]: Start accepts. Automaton has 22129 states and 30480 transitions. Word has length 149 [2025-01-09 04:51:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:53,656 INFO L471 AbstractCegarLoop]: Abstraction has 22129 states and 30480 transitions. [2025-01-09 04:51:53,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-09 04:51:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 22129 states and 30480 transitions. [2025-01-09 04:51:53,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 04:51:53,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:53,659 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:53,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:51:53,659 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:53,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:53,660 INFO L85 PathProgramCache]: Analyzing trace with hash -329011218, now seen corresponding path program 1 times [2025-01-09 04:51:53,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:53,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013144533] [2025-01-09 04:51:53,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:53,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 04:51:53,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 04:51:53,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:53,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:51:53,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:53,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013144533] [2025-01-09 04:51:53,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013144533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:53,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:53,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:51:53,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57369042] [2025-01-09 04:51:53,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:53,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:51:53,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:53,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:51:53,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:51:53,747 INFO L87 Difference]: Start difference. First operand 22129 states and 30480 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-09 04:51:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:53,856 INFO L93 Difference]: Finished difference Result 63965 states and 87602 transitions. [2025-01-09 04:51:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:51:53,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 150 [2025-01-09 04:51:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:53,904 INFO L225 Difference]: With dead ends: 63965 [2025-01-09 04:51:53,904 INFO L226 Difference]: Without dead ends: 41947 [2025-01-09 04:51:53,927 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-09 04:51:53,928 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 54 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:53,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:51:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41947 states. [2025-01-09 04:51:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41947 to 39145. [2025-01-09 04:51:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39145 states, 39144 states have (on average 1.3601062742693644) internal successors, (53240), 39144 states have internal predecessors, (53240), 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-09 04:51:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39145 states to 39145 states and 53240 transitions. [2025-01-09 04:51:54,569 INFO L78 Accepts]: Start accepts. Automaton has 39145 states and 53240 transitions. Word has length 150 [2025-01-09 04:51:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:54,570 INFO L471 AbstractCegarLoop]: Abstraction has 39145 states and 53240 transitions. [2025-01-09 04:51:54,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-09 04:51:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 39145 states and 53240 transitions. [2025-01-09 04:51:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 04:51:54,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:54,574 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:51:54,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:51:54,574 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:54,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1677295096, now seen corresponding path program 1 times [2025-01-09 04:51:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:54,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006855191] [2025-01-09 04:51:54,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:54,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:54,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 04:51:54,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 04:51:54,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:54,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:55,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:55,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006855191] [2025-01-09 04:51:55,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006855191] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:51:55,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531324604] [2025-01-09 04:51:55,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:55,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:51:55,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:51:55,081 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-09 04:51:55,082 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-09 04:51:55,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 04:51:55,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 04:51:55,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:55,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:55,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:51:55,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:51:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:56,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:51:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:57,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531324604] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:51:57,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:51:57,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2025-01-09 04:51:57,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923008313] [2025-01-09 04:51:57,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:51:57,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 04:51:57,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:57,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 04:51:57,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:51:57,378 INFO L87 Difference]: Start difference. First operand 39145 states and 53240 transitions. Second operand has 27 states, 27 states have (on average 15.703703703703704) internal successors, (424), 26 states have internal predecessors, (424), 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-09 04:52:02,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:02,476 INFO L93 Difference]: Finished difference Result 350345 states and 472749 transitions. [2025-01-09 04:52:02,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-01-09 04:52:02,477 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 15.703703703703704) internal successors, (424), 26 states have internal predecessors, (424), 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 151 [2025-01-09 04:52:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:02,930 INFO L225 Difference]: With dead ends: 350345 [2025-01-09 04:52:02,930 INFO L226 Difference]: Without dead ends: 311311 [2025-01-09 04:52:03,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4695 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2630, Invalid=13372, Unknown=0, NotChecked=0, Total=16002 [2025-01-09 04:52:03,045 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 2733 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 3963 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 3994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:03,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 2418 Invalid, 3994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3963 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 04:52:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311311 states. [2025-01-09 04:52:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311311 to 193875. [2025-01-09 04:52:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193875 states, 193874 states have (on average 1.3524144547489607) internal successors, (262198), 193874 states have internal predecessors, (262198), 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-09 04:52:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193875 states to 193875 states and 262198 transitions. [2025-01-09 04:52:06,506 INFO L78 Accepts]: Start accepts. Automaton has 193875 states and 262198 transitions. Word has length 151 [2025-01-09 04:52:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:06,506 INFO L471 AbstractCegarLoop]: Abstraction has 193875 states and 262198 transitions. [2025-01-09 04:52:06,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 15.703703703703704) internal successors, (424), 26 states have internal predecessors, (424), 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-09 04:52:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 193875 states and 262198 transitions. [2025-01-09 04:52:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 04:52:06,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:06,519 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:06,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:52:06,720 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,SelfDestructingSolverStorable35 [2025-01-09 04:52:06,720 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:52:06,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:06,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1459257078, now seen corresponding path program 1 times [2025-01-09 04:52:06,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:06,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386285674] [2025-01-09 04:52:06,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:06,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:06,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 04:52:06,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 04:52:06,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:06,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:07,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:07,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386285674] [2025-01-09 04:52:07,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386285674] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:52:07,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964186525] [2025-01-09 04:52:07,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:07,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:52:07,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:52:07,189 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-09 04:52:07,191 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-09 04:52:07,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 04:52:07,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 04:52:07,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:07,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:07,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 04:52:07,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:52:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:08,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:52:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:09,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964186525] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:52:09,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:52:09,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 29 [2025-01-09 04:52:09,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43728259] [2025-01-09 04:52:09,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:52:09,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 04:52:09,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:52:09,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 04:52:09,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:52:09,559 INFO L87 Difference]: Start difference. First operand 193875 states and 262198 transitions. Second operand has 30 states, 30 states have (on average 11.733333333333333) internal successors, (352), 29 states have internal predecessors, (352), 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-09 04:52:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:52:17,592 INFO L93 Difference]: Finished difference Result 1381071 states and 1854416 transitions. [2025-01-09 04:52:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2025-01-09 04:52:17,598 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 11.733333333333333) internal successors, (352), 29 states have internal predecessors, (352), 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 151 [2025-01-09 04:52:17,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:52:19,455 INFO L225 Difference]: With dead ends: 1381071 [2025-01-09 04:52:19,455 INFO L226 Difference]: Without dead ends: 1187347 [2025-01-09 04:52:19,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7073 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3122, Invalid=18930, Unknown=0, NotChecked=0, Total=22052 [2025-01-09 04:52:19,969 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 3777 mSDsluCounter, 4907 mSDsCounter, 0 mSdLazyCounter, 5150 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3777 SdHoareTripleChecker+Valid, 5180 SdHoareTripleChecker+Invalid, 5192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 5150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:52:19,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3777 Valid, 5180 Invalid, 5192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 5150 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 04:52:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187347 states. [2025-01-09 04:52:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187347 to 708543. [2025-01-09 04:52:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708543 states, 708542 states have (on average 1.3466639945126753) internal successors, (954168), 708542 states have internal predecessors, (954168), 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-09 04:52:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708543 states to 708543 states and 954168 transitions. [2025-01-09 04:52:33,224 INFO L78 Accepts]: Start accepts. Automaton has 708543 states and 954168 transitions. Word has length 151 [2025-01-09 04:52:33,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:52:33,225 INFO L471 AbstractCegarLoop]: Abstraction has 708543 states and 954168 transitions. [2025-01-09 04:52:33,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.733333333333333) internal successors, (352), 29 states have internal predecessors, (352), 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-09 04:52:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 708543 states and 954168 transitions. [2025-01-09 04:52:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 04:52:33,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:52:33,265 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:52:33,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 04:52:33,465 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,SelfDestructingSolverStorable36 [2025-01-09 04:52:33,466 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:52:33,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:52:33,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1884338769, now seen corresponding path program 1 times [2025-01-09 04:52:33,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:52:33,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512298824] [2025-01-09 04:52:33,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:33,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:52:33,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 04:52:33,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 04:52:33,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:33,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:52:34,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:52:34,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512298824] [2025-01-09 04:52:34,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512298824] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:52:34,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017452573] [2025-01-09 04:52:34,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:52:34,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:52:34,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:52:34,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:52:34,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:52:34,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 04:52:34,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 04:52:34,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:52:34,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:52:34,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 04:52:34,338 INFO L279 TraceCheckSpWp]: Computing forward predicates...